Pages that link to "Item:Q3763600"

The following pages link to Improving the performance guarantee for approximate graph coloring (Q3763600):

Displaying 37 items.

• An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs (Q290195) (← links)
• Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
• A better performance guarantee for approximate graph coloring (Q911757) (← links)
• A simple algorithm for 4-coloring 3-colorable planar graphs (Q974757) (← links)
• Combinatorial optimization in system configuration design (Q1027725) (← links)
• Worst case analysis of a graph coloring algorithm (Q1066156) (← links)
• Decomposing a set of points into chains, with applications to permutation and circle graphs (Q1071505) (← links)
• On the complexity of H-coloring (Q1100215) (← links)
• An on-line graph coloring algorithm with sublinear performance ratio (Q1124602) (← links)
• The smallest hard-to-color graph (Q1185079) (← links)
• Approximating maximum independent sets by excluding subgraphs (Q1196452) (← links)
• A still better performance guarantee for approximate graph coloring (Q1209311) (← links)
• The greedy algorithm is optimal for on-line edge coloring (Q1209350) (← links)
• The maximum clique problem (Q1318271) (← links)
• Randomized graph products, chromatic numbers, and the Lovász \(\vartheta\)-function (Q1375058) (← links)
• The allocation problem in hardware design (Q1801667) (← links)
• Three-quarter approximation for the number of unused colors in graph coloring (Q1818979) (← links)
• Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
• Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes (Q2968149) (← links)
• Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with $2^{(\log {n})^{\Omega(1)}}$ Colors (Q2968154) (← links)
• New Tools for Graph Coloring (Q3088076) (← links)
• Efficient Vertex- and Edge-Coloring of Outerplanar Graphs (Q3705474) (← links)
• On the Complexity of Scheduling to Optimize Average Response Time (Q4272552) (← links)
• Local-Global Phenomena in Graphs (Q4290099) (← links)
• Distributed algorithms for maximum cliques (Q4338575) (← links)
• Coloring bipartite hypergraphs (Q4645934) (← links)
• Approximating maximum independent sets by excluding subgraphs (Q5056088) (← links)
• (Q5092401) (← links)
• Hardness of Rainbow Coloring Hypergraphs (Q5136325) (← links)
• Finding Pseudorandom Colorings of Pseudorandom Graphs (Q5136329) (← links)
• Linear Index Coding via Semidefinite Programming (Q5410256) (← links)
• (Q5743408) (← links)
• (Q5870293) (← links)
• CLAP: A New Algorithm for Promise CSPs (Q5885595) (← links)
• Approximating \(k\)-forest with resource augmentation: a primal-dual approach (Q5919564) (← links)
• Robust Factorizations and Colorings of Tensor Graphs (Q6195952) (← links)
• Coloring tournaments with few colors: algorithms and complexity (Q6654122) (← links)