scientific article
From MaRDI portal
Publication:3859792
zbMath0425.05028MaRDI QIDQ3859792
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Directed graphs (digraphs), tournaments (05C20) Combinatorial aspects of packing and covering (05B40)
Related Items
On box totally dual integral polyhedra, Stronger bounds and faster algorithms for packing in generalized kernel systems, Finding popular branchings in vertex-weighted digraphs, Objective functions with redundant domains, Generalized polymatroids and submodular flows, An application of submodular flows, A simple algorithm and min-max formula for the inverse arborescence problem, On the \(L_{\infty}\)-norm of extreme points for crossing supermodular directed network LPs, Packing cycles exactly in polynomial time, Finding popular branchings in vertex-weighted directed graphs, On the orientation of graphs and hypergraphs, A Survey on Covering Supermodular Functions, Restricted covering of digraphs with arborescences, The ellipsoid method and its consequences in combinatorial optimization, Proving total dual integrality with cross-free families—A general framework, The \(k\)-path tree matroid and its applications to survivable network design, Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs, On rooted \(k\)-connectivity problems in quasi-bipartite digraphs, Packing in generalized kernel systems: a framework that generalizes packing of branchings, Covering Intersecting Bi-set Families under Matroid Constraints, Rooted \(k\)-connections in digraphs, Polyhedra related to a lattice, Packing algorithms for arborescences (and spanning trees) in capacitated graphs, Packing and covering of crossing families of cuts, Finding feasible vectors of Edmonds-Giles polyhedra, Total weak unimodularity: Testing and applications, Directed Steiner problems with connectivity constraints, Bibliography on domination in graphs and some basic definitions of domination parameters, Inverse optimization problems with multiple weight functions, On rooted \(k\)-connectivity problems in quasi-bipartite digraphs
