Pages that link to "Item:Q1200792"

The following pages link to Separating from the dominant of the spanning tree polytope (Q1200792):

Displaying 19 items.

• Faster algorithms for security games on matroids (Q666676) (← links)
• A faster algorithm for computing the principal sequence of partitions of a graph (Q848839) (← links)
• Design of survivable IP-over-optical networks (Q863570) (← links)
• A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions (Q975757) (← links)
• A new algorithm for the intersection of a line with the independent set polytope of a matroid (Q1004529) (← links)
• Minimizing symmetric submodular functions (Q1290631) (← links)
• Random sampling and greedy sparsification for matroid optimization problems (Q1290633) (← links)
• A faster algorithm for computing the strength of a network (Q1318743) (← links)
• Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness (Q1602687) (← links)
• Separation of partition inequalities for the \((1,2)\)-survivable network design problem (Q1866009) (← links)
• On two-connected subgraph polytopes (Q1910503) (← links)
• On the \(k\)-cut problem (Q1977642) (← links)
• On some algorithmic aspects of hypergraphic matroids (Q2099466) (← links)
• Separation of partition inequalities with terminals (Q2386198) (← links)
• \(k\)-edge connected polyhedra on series-parallel graphs (Q2564304) (← links)
• Network reinforcement (Q2583121) (← links)
• Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut (Q2583145) (← links)
• Graphic Submodular Function Minimization: A Graphic Approach and Applications (Q2971617) (← links)
• Optimal hierarchical clustering on a graph (Q6065857) (← links)