Pages that link to "Item:Q1028481"
From MaRDI portal
The following pages link to Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481):
Displaying 16 items.
- The assignment problem with nearly Monge arrays and incompatible partner indices (Q335350) (← 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)
- 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)
- Clique partitioning with value-monotone submodular cost (Q2339847) (← links)
- A note on the Cornaz-Jost transformation to solve the graph coloring problem (Q2444903) (← links)
- Bounded max-colorings of graphs (Q2447538) (← links)
- No-Wait Scheduling Problems with Batching Machines (Q2958672) (← 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)
- Dual parameterization of Weighted Coloring (Q5009474) (← links)
