On the dominant of the multicut polytope
DOI10.1007/S00454-024-00646-WMaRDI QIDQ6624194
Alexander Nover, Martina Juhnke, Markus Chimani
Publication date: 25 October 2024
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Primal-dual approximation algorithms for integral flow and multicut in trees
- Facets for the cut cone. I
- Facets for the cut cone. II: Clique-web inequalities
- Max-cut in circulant graphs
- Incidence matrices and interval graphs
- On the dominant of the \(s\)-\(t\)-cut polytope: vertices, facets, and adjacency
- Maximal Flow Through a Network
- Approximating the k-multicut problem
- Polytopes, Rings, and K-Theory
- Clique-Web Facets for Multicut Polytopes
- Multiprocessor Scheduling with the Aid of Network Flow Algorithms
- The Complexity of Multiterminal Cuts
- On the cut polytope
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
- Reducibility among Combinatorial Problems
- Geometry of cuts and metrics
This page was built for publication: On the dominant of the multicut polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6624194)
