How to tidy up a symmetric set-system by use of uncrossing operations

DOI10.1016/0304-3975(95)00160-3zbMath0868.90139OpenAlexW2061549332MaRDI QIDQ1351503

Alexander V. Karzanov

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00160-3

zbMATH Keywords

crossing setscut packing problemuncrossing

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) 2-person games (91A05) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Polynomial-time approximability of the asymmetric problem of covering a graph by a bounded number of cycles ⋮ Tree metrics and edge-disjoint \(S\)-paths ⋮ Reducing Path TSP to TSP

Cites Work

• Geometric algorithms and combinatorial optimization
• On Odd Cuts and Plane Multicommodity Flows
• Matching, Euler tours and the Chinese postman
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: How to tidy up a symmetric set-system by use of uncrossing operations