Finding minimum balanced separators -- an exact approach

DOI10.1007/978-3-031-08623-6_24MaRDI QIDQ6606653zbMATH OpenFDO

Authors Ralf Borndörfer, Stephan Schwartz

Publication date 17 September 2024

Full work available at URL https://doi.org/10.1007/978-3-031-08623-6_24

zbMATH Keywords

integer programmingnode separators

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• A framework for solving VLSI graph layout problems
• Algorithms – ESA 2005
• Approximating small balanced vertex separators in almost linear time
• Exact algorithms for the vertex separator problem in graphs
• Exact approaches for solving a covering problem with capacitated subtrees
• Finding good approximate vertex and edge partitions is NP-hard
• Graph separators, with applications
• Improved Approximation Algorithms for Minimum Weight Vertex Separators
• New models for commercial territory design

This page was built for publication: Finding minimum balanced separators -- an exact approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606653)