A New Approach to Splitting-Off
From MaRDI portal
Publication:3503862
DOI10.1007/978-3-540-68891-4_28zbMath1143.90374OpenAlexW1550803728MaRDI QIDQ3503862
Publication date: 10 June 2008
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: http://real.mtak.hu/19434/1/egres_08_02_u_163218.843029.pdf
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (4)
Covering symmetric supermodular functions with graph edges: a short proof of a theorem of Benczúr and Frank ⋮ A New Approach to Splitting-Off ⋮ A unifying approach to splitting-off ⋮ Augmenting edge-connectivity between vertex subsets
Cites Work
- Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs
- Local edge-connectivity augmentation in hypergraphs is NP-complete
- Edge-connectivity augmentation problems
- Covering symmetric supermodular functions by graphs
- Hypergraph connectivity augmentation
- Covering symmetric semi-monotone functions
- A New Approach to Splitting-Off
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- A Reduction Method for Edge-Connectivity in Graphs
- NA-EDGE-CONNECTIVITY AUGMENTATION PROBLEMS BY ADDING EDGES(<Special Issue>Network Design, Control and Optimization)
- Preserving and Increasing Local Edge-Connectivity in Mixed Graphs
This page was built for publication: A New Approach to Splitting-Off
