Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

DOI10.1007/b99805zbMath1106.68082OpenAlexW4301133941MaRDI QIDQ5313038

Abraham D. Flaxman, Alan M. Frieze

Publication date: 25 August 2005

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

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (2)

Smoothed analysis of binary search trees ⋮ Expansion and Lack Thereof in Randomly Perturbed Graphs

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