The following pages link to Theoretical Computer Science (Q5395073):
Displaying 8 items.
- Bounds and fixed-parameter algorithms for weighted improper coloring (Q737104) (← links)
- Models and heuristic algorithms for a weighted vertex coloring problem (Q1038841) (← links)
- Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem (Q2102838) (← links)
- A comparison of integer programming models for the partial directed weighted improper coloring problem (Q2414468) (← links)
- Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs (Q2819518) (← links)
- Clique partitioning of interval graphs with submodular costs on the cliques (Q3004202) (← links)
- Ruling out FPT algorithms for weighted coloring on forests (Q5916046) (← links)
- Mobility offer allocations in corporate settings (Q6114908) (← links)
