Approximating Minimum Cut with Bounded Size

DOI10.1007/978-3-642-21527-8_26zbMath1344.68175OpenAlexW47413040MaRDI QIDQ3091504

Giulia Galbiati

Publication date: 9 September 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-21527-8_26

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)

Related Items (1)

Computational experience with a SDP-based algorithm for maximum cut with limited unbalance

This page was built for publication: Approximating Minimum Cut with Bounded Size