Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems
From MaRDI portal
Publication:1406022
DOI10.1016/S0166-218X(02)00570-XzbMath1030.90094MaRDI QIDQ1406022
Publication date: 9 September 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)
Related Items (3)
Jump Number of Two-Directional Orthogonal Ray Graphs ⋮ Another note on Dilworth's decomposition theorem. ⋮ Independent sets and hitting sets of bicolored rectangular families
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A minimax theorem on intervals
- Edge-connectivity augmentation problems
- The ellipsoid method and its consequences in combinatorial optimization
- A weighted min-max relation for intervals
- Parallel and fast sequential algorithms for undirected edge connectivity augmentation
- Finding minimum generators of path systems
- On the optimal vertex-connectivity augmentation
- Minimal edge-coverings of pairs of sets
- Efficient splitting off algorithms for graphs
- An algorithm for covering polygons with rectangles
- The minimum augmentation of any graph to aK-edge-connected graph
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- Augmenting Undirected Edge Connectivity in Õ(n2) Time
- Irredundant intervals
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
This page was built for publication: Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems
