Pages that link to "Item:Q1404543"
From MaRDI portal
The following pages link to Polynomial approximation and graph-coloring (Q1404543):
Displaying 12 items.
- A survey on the structure of approximation classes (Q458503) (← links)
- Polynomial approximation on graphs (Q801444) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Approximation results for the minimum graph coloring problem (Q1321829) (← links)
- Three-quarter approximation for the number of unused colors in graph coloring (Q1818979) (← links)
- \(\sigma\)-polynomials and graph coloring (Q1891610) (← links)
- New potential functions for greedy independence and coloring (Q2255044) (← links)
- Polynomial-time approximation algorithms for the coloring problem in some cases (Q2359789) (← links)
- A simple approximation algorithm for WIS based on the approximability in \(k\)-partite graphs (Q2576274) (← links)
- A NEW APPROACH TO THE VERTEX COLORING PROBLEM (Q2790363) (← links)
- A procedure for the strategic planning of locations, capacities and districting of jails: application to Chile (Q4680754) (← links)
- Faster graph coloring in polynomial space (Q5920158) (← links)