Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

DOI10.1007/b11961zbMath1279.05068OpenAlexW4298253479MaRDI QIDQ5900945

Michael Krivelevich, Dana Ron, Tali Kaufman

Publication date: 26 May 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b11961

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

A Brief Introduction to Property Testing ⋮ \(\omega\)-regular languages are testable with a constant number of queries ⋮ A Brief Introduction to Property Testing ⋮ Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing

This page was built for publication: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques