Improved Algorithms for 3-Coloring, 3-Edge-Coloring, and Constraint Satisfaction
David Eppstein
Abstract
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3-list-coloring. Our algorithms are based on a constraint satisfaction (CSP) formulation of these problems; 3-SAT is equivalent to (2,3)-CSP while the other problems above are special cases of (3,2)-CSP. We give a fast algorithm for (3,2)-CSP and use it to improve the time bounds for solving the other problems listed above. Our techniques involve a mixture of Davis-Putnam-style backtracking with more sophisticated matching and network flow based ideas.
Create a lesson
Related papers
A Simple Subquadratic Cut Query Protocol for Directed Reachability
Henry Fleischmann, Sagnik Mukhopadhyay, Swagato Sanyal
Online Edge-Weighted Matching Beyond 0.55
Alireza Farhadi, Mohammad Hajiaghayi
Nonuniform Buy-at-Bulk Network Design: Improved Approximation and LP Integrality Gap
Iman Gholami, MohammadTaghi Hajiaghayi
Prophet Secretary for Matroids and XOS Valuations: A Strict Separation at 1-1/e
Hossein Esfandiari, MohammadTaghi Hajiaghayi
Deterministic Fault-Tolerant Connectivity Oracles with Subquadratic Space
Merav Parter, Elad Tzalik
The 3-Uniform Hyperclique Hypothesis is False
Timothy M. Chan, Reina Itakura, Zhiyuan Ma et al.