Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems (Q1406022): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel and fast sequential algorithms for undirected edge connectivity augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting Undirected Edge Connectivity in Õ(n2) Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum augmentation of any graph to aK-edge-connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting Graphs to Meet Edge-Connectivity Requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding minimum generators of path systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal edge-coverings of pairs of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for covering polygons with rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient splitting off algorithms for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimax theorem on intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimal vertex-connectivity augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irredundant intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A weighted min-max relation for intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-connectivity augmentation problems / rank
 
Normal rank

Latest revision as of 10:50, 6 June 2024

scientific article
Language Label Description Also known as
English
Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems
scientific article

    Statements

    Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems (English)
    0 references
    9 September 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    optimization problems
    0 references
    edge augmentation
    0 references