Approximation and Online Algorithms
From MaRDI portal
Publication:5898461
DOI10.1007/11671411zbMath1125.68426OpenAlexW4210634114MaRDI QIDQ5898461
Ido Berkovitch, Adi Avidor, Uri Zwick
Publication date: 12 February 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11671411
Related Items
Local Search to Approximate Max NAE-$$k$$-Sat Tightly, Complexity of approximating CSP with balance/hard constraints, Revisiting maximum satisfiability and related problems in data streams, Revisiting maximum satisfiability and related problems in data streams, Solving the weighted MAX-SAT problem using the dynamic convexized method, When polynomial approximation meets exact computation, Approximation Algorithms for CSPs, Approximating MAX SAT by moderately exponential and parameterized algorithms, On extensions of the deterministic online model for bipartite matching and max-sat, Approximating Max NAE-\(k\)-SAT by anonymous local search, When polynomial approximation meets exact computation, A simple rounding scheme for multistage optimization, Locally defined independence systems on graphs, Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds