Pages that link to "Item:Q911757"
From MaRDI portal
The following pages link to A better performance guarantee for approximate graph coloring (Q911757):
Displaying 12 items.
- Approximating maximum independent sets by excluding subgraphs (Q1196452) (← links)
- A still better performance guarantee for approximate graph coloring (Q1209311) (← links)
- Periodic assignment and graph colouring (Q1329789) (← links)
- Mutual exclusion scheduling (Q1365931) (← links)
- Approximating the independence number via the \(\vartheta\)-function (Q1380939) (← links)
- Polynomial approximation and graph-coloring (Q1404543) (← links)
- The allocation problem in hardware design (Q1801667) (← links)
- Improving the performance guarantee for approximate graph coloring (Q3763600) (← links)
- On the Complexity of Scheduling to Optimize Average Response Time (Q4272552) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness (Q4984870) (← links)
- Approximating maximum independent sets by excluding subgraphs (Q5056088) (← links)
- Robust Factorizations and Colorings of Tensor Graphs (Q6195952) (← links)