Increasing the rooted connectivity of a digraph by one
From MaRDI portal
Publication:1300061
DOI10.1007/s101070050040zbMath0930.05074OpenAlexW1972453585MaRDI QIDQ1300061
Publication date: 30 January 2000
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070050040
Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Stronger bounds and faster algorithms for packing in generalized kernel systems ⋮ Dual greedy polyhedra, choice functions, and abstract convex geometries ⋮ A simple algorithm and min-max formula for the inverse arborescence problem ⋮ On generalizations of network design problems with degree bounds ⋮ Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested ⋮ Lattice polyhedra and submodular flows ⋮ A ranking model for the greedy algorithm and discrete convexity ⋮ A greedy algorithm for convex geometries ⋮ A Primal-Dual Algorithm for Weighted Abstract Cut Packing ⋮ Note on pseudolattices, lattices and submodular linear programs ⋮ Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming ⋮ Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs ⋮ Greedy oriented flows ⋮ Approximating minimum power covers of intersecting families and directed edge-connectivity problems ⋮ Lattices and Maximum Flow Algorithms in Planar Graphs ⋮ Packing in generalized kernel systems: a framework that generalizes packing of branchings ⋮ A Hierarchical Model for Cooperative Games ⋮ Rooted \(k\)-connections in digraphs ⋮ Approximating minimum-power edge-covers and 2,3-connectivity
This page was built for publication: Increasing the rooted connectivity of a digraph by one
