Pages that link to "Item:Q1300061"

The following pages link to Increasing the rooted connectivity of a digraph by one (Q1300061):

Displaying 19 items.

• Stronger bounds and faster algorithms for packing in generalized kernel systems (Q312660) (← links)
• On generalizations of network design problems with degree bounds (Q378106) (← links)
• Note on pseudolattices, lattices and submodular linear programs (Q951121) (← links)
• Approximating minimum power covers of intersecting families and directed edge-connectivity problems (Q974743) (← links)
• Rooted \(k\)-connections in digraphs (Q1025990) (← links)
• Approximating minimum-power edge-covers and 2,3-connectivity (Q1026146) (← links)
• A greedy algorithm for convex geometries (Q1410695) (← links)
• Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming (Q1749453) (← links)
• Greedy oriented flows (Q1751094) (← links)
• Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
• Lattice polyhedra and submodular flows (Q1926644) (← links)
• Dual greedy polyhedra, choice functions, and abstract convex geometries (Q2386212) (← links)
• A ranking model for the greedy algorithm and discrete convexity (Q2429474) (← 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)
• A Primal-Dual Algorithm for Weighted Abstract Cut Packing (Q3009773) (← links)
• Lattices and Maximum Flow Algorithms in Planar Graphs (Q3057636) (← links)
• A Hierarchical Model for Cooperative Games (Q5459987) (← links)
• Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195) (← links)