scientific article; zbMATH DE number 7650095
From MaRDI portal
Publication:5875482
DOI10.4230/LIPIcs.APPROX-RANDOM.2019.28MaRDI QIDQ5875482
Anand Louis, Rahul Raychaudhury, Suprovat Ghoshal
Publication date: 3 February 2023
Full work available at URL: https://arxiv.org/abs/1908.11631
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs
- Finding odd cycle transversals.
- Ramsey numbers and an approximation algorithm for the vertex cover problem
- Heuristics for semirandom graph problems
- New approximation guarantee for chromatic number
- New Tools for Graph Coloring
- Coloring 3-Colorable Graphs with Less than n 1/5 Colors
- O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
- Approximate graph coloring by semidefinite programming
- New approximation algorithms for graph coloring
- A Spectral Technique for Coloring Random 3-Colorable Graphs
- Coloring Random and Semi-Random k-Colorable Graphs
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
- Faster Parameterized Algorithms Using Linear Programming
- Reducibility among Combinatorial Problems
- Finding Pseudorandom Colorings of Pseudorandom Graphs
- A New Algorithm for the Robust Semi-random Independent Set Problem
- Optimal Long Code Test with One Free Bit
- How to Round Any CSP
- Constant factor approximation for balanced cut in the PIE model
- On the effect of randomness on planted 3-coloring models
- Approximation algorithms for semi-random partitioning problems
- How to Play Unique Games Against a Semi-random Adversary: Study of Semi-random Models of Unique Games
- Rounding Semidefinite Programming Hierarchies via Global Correlation
- Expander flows, geometric embeddings and graph partitioning
This page was built for publication:
