The following pages link to (Q3859792):
Displaying 27 items.
- Stronger bounds and faster algorithms for packing in generalized kernel systems (Q312660) (← links)
- Packing cycles exactly in polynomial time (Q421271) (← links)
- Packing and covering of crossing families of cuts (Q789399) (← links)
- Finding feasible vectors of Edmonds-Giles polyhedra (Q796541) (← links)
- Total weak unimodularity: Testing and applications (Q798401) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- On the \(L_{\infty}\)-norm of extreme points for crossing supermodular directed network LPs (Q877196) (← links)
- Restricted covering of digraphs with arborescences (Q913812) (← links)
- The \(k\)-path tree matroid and its applications to survivable network design (Q951105) (← links)
- Rooted \(k\)-connections in digraphs (Q1025990) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- An application of submodular flows (Q1119596) (← links)
- The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
- Directed Steiner problems with connectivity constraints (Q1315992) (← links)
- On the orientation of graphs and hypergraphs (Q1410690) (← links)
- Inverse optimization problems with multiple weight functions (Q2112661) (← links)
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q2117101) (← links)
- Finding popular branchings in vertex-weighted digraphs (Q2154110) (← links)
- Objective functions with redundant domains (Q2392743) (← links)
- Packing in generalized kernel systems: a framework that generalizes packing of branchings (Q2515040) (← links)
- A simple algorithm and min-max formula for the inverse arborescence problem (Q2661220) (← links)
- Finding popular branchings in vertex-weighted directed graphs (Q2693638) (← links)
- Covering Intersecting Bi-set Families under Matroid Constraints (Q2820858) (← links)
- A Survey on Covering Supermodular Functions (Q2971606) (← links)
- Proving total dual integrality with cross-free families—A general framework (Q3313630) (← links)
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195) (← links)
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q6200809) (← links)
