Pages that link to "Item:Q1045908"
From MaRDI portal
The following pages link to Weighted coloring: further complexity and approximability results (Q1045908):
Displaying 29 items.
- The assignment problem with nearly Monge arrays and incompatible partner indices (Q335350) (← links)
- Exact weighted vertex coloring via branch-and-price (Q448972) (← links)
- Max-coloring paths: tight bounds and extensions (Q454245) (← links)
- On the max-weight edge coloring problem (Q613668) (← links)
- On the max coloring problem (Q690449) (← links)
- Clique clustering yields a PTAS for max-coloring interval graphs (Q722535) (← links)
- Dual parameterization of weighted coloring (Q786042) (← links)
- Approximating the max-edge-coloring problem (Q986540) (← links)
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481) (← links)
- Models and heuristic algorithms for a weighted vertex coloring problem (Q1038841) (← links)
- Open shop scheduling with synchronization (Q1702656) (← links)
- Saving colors and max coloring: some fixed-parameter tractability results (Q1755584) (← links)
- Improved approximation algorithms for the max edge-coloring problem (Q1944142) (← links)
- Parameterized complexity of list coloring and max coloring (Q2097212) (← links)
- Interval scheduling with economies of scale (Q2108158) (← links)
- Clique partitioning with value-monotone submodular cost (Q2339847) (← links)
- Bounded max-colorings of graphs (Q2447538) (← links)
- Polynomial approximation: a structural and operational study. (Abstract of thesis) (Q2644383) (← links)
- Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs (Q2819518) (← links)
- A survey on vertex coloring problems (Q3002686) (← links)
- Clique Clustering Yields a PTAS for max-Coloring Interval Graphs (Q3012804) (← links)
- Saving Colors and Max Coloring: Some Fixed-Parameter Tractability Results (Q3181046) (← links)
- Batch Coloring Flat Graphs and Thin (Q3512459) (← links)
- On the Maximum Edge Coloring Problem (Q3602848) (← links)
- Dual parameterization of Weighted Coloring (Q5009474) (← links)
- On the Max Coloring Problem (Q5443379) (← links)
- “Rent-or-Buy” Scheduling and Cost Coloring Problems (Q5458824) (← links)
- Ruling out FPT algorithms for weighted coloring on forests (Q5916046) (← links)
- Max-coloring of vertex-weighted graphs (Q5964985) (← links)
