Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems
type: Item
instance of: scholarly article
title: Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems
zbMATH Open document ID: 1030.90094
DOI: 10.1016/S0166-218X(02)00570-X
author: András A. Benczúr
published in: Discrete Applied Mathematics
publication date: 2003-09-09T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1977896
zbMATH Keywords: optimization problems
zbMATH Keywords: edge augmentation
MaRDI profile type: Publication
cites work: Parallel and fast sequential algorithms for undirected edge connectivity augmentation
cites work: Q4938791
cites work: Augmenting Undirected Edge Connectivity in Õ(n2) Time
cites work: The minimum augmentation of any graph to aK-edge-connected graph
cites work: Augmenting Graphs to Meet Edge-Connectivity Requirements
cites work: Finding minimum generators of path systems
cites work: Q4263470
cites work: Minimal edge-coverings of pairs of sets
cites work: An algorithm for covering polygons with rectangles
cites work: Q5514188
cites work: Efficient splitting off algorithms for graphs
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: A minimax theorem on intervals
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: On the optimal vertex-connectivity augmentation
cites work: Q4542522
cites work: Irredundant intervals
cites work: A weighted min-max relation for intervals
cites work: Edge-connectivity augmentation problems
description: scientific article; zbMATH DE number 1977896