The following pages link to (Q4414490):
Displaying 21 items.
- The assignment problem with nearly Monge arrays and incompatible partner indices (Q335350) (← links)
- On the max-weight edge coloring problem (Q613668) (← links)
- Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) (Q706963) (← links)
- Dual parameterization of weighted coloring (Q786042) (← links)
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481) (← links)
- Weighted coloring: further complexity and approximability results (Q1045908) (← links)
- Open shop scheduling with synchronization (Q1702656) (← links)
- A hypocoloring model for batch scheduling (Q1765371) (← links)
- The maximum saving partition problem (Q1779697) (← links)
- Maximum-weight stable sets and safe lower bounds for graph coloring (Q1946922) (← links)
- Parameterized complexity of list coloring and max coloring (Q2097212) (← links)
- A note on the Cornaz-Jost transformation to solve the graph coloring problem (Q2444903) (← links)
- On the probabilistic minimum coloring and minimum \(k\)-coloring (Q2489951) (← links)
- A one-to-one correspondence between colorings and stable sets (Q2517790) (← links)
- Scheduling on a batch processing machine with split compatibility graphs (Q2583507) (← links)
- On the Maximum Edge Coloring Problem (Q3602848) (← links)
- Differential approximation of NP-hard problems with equal size feasible solutions (Q4457890) (← links)
- Dual parameterization of Weighted Coloring (Q5009474) (← links)
- A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs (Q5154765) (← links)
- Ruling out FPT algorithms for weighted coloring on forests (Q5916046) (← links)
- Max-coloring of vertex-weighted graphs (Q5964985) (← links)
