The following pages link to (Q4414490):
Displayed 11 items.
- On the max-weight edge coloring problem (Q613668) (← links)
- Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) (Q706963) (← links)
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481) (← links)
- Weighted coloring: further complexity and approximability results (Q1045908) (← links)
- A hypocoloring model for batch scheduling (Q1765371) (← links)
- The maximum saving partition problem (Q1779697) (← 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)