scientific article; zbMATH DE number 3661345
From MaRDI portal
Publication:3859792
Cited in
(31)- Rooted \(k\)-connections in digraphs
- Generalized polymatroids and submodular flows
- An application of submodular flows
- The ellipsoid method and its consequences in combinatorial optimization
- Directed Steiner problems with connectivity constraints
- On the orientation of graphs and hypergraphs
- Inverse optimization problems with multiple weight functions
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs
- Finding popular branchings in vertex-weighted digraphs
- Objective functions with redundant domains
- Packing in generalized kernel systems: a framework that generalizes packing of branchings
- A simple algorithm and min-max formula for the inverse arborescence problem
- Finding popular branchings in vertex-weighted directed graphs
- Covering intersecting bi-set families under matroid constraints
- A Survey on Covering Supermodular Functions
- Stronger bounds and faster algorithms for packing in generalized kernel systems
- Proving total dual integrality with cross-free families—A general framework
- On box totally dual integral polyhedra
- Polyhedra related to a lattice
- Packing cycles exactly in polynomial time
- Packing algorithms for arborescences (and spanning trees) in capacitated graphs
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs
- A new approach for approximating directed rooted networks
- Packing and covering of crossing families of cuts
- Finding feasible vectors of Edmonds-Giles polyhedra
- Total weak unimodularity: Testing and applications
- Bibliography on domination in graphs and some basic definitions of domination parameters
- On the \(L_{\infty}\)-norm of extreme points for crossing supermodular directed network LPs
- Restricted covering of digraphs with arborescences
- The k-path tree matroid and its applications to survivable network design
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3859792)