The following pages link to (Q2718910):
Displayed 14 items.
- 1-Approximation algorithm for bottleneck disjoint path matching (Q672495) (← links)
- On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems (Q791320) (← links)
- Shunting minimal rail car allocation (Q812422) (← links)
- Solving k-shortest and constrained shortest path problems efficiently (Q918435) (← links)
- Inferring (biological) signal transduction networks via transitive reductions of directed graphs (Q930591) (← links)
- Random matroids (Q1220516) (← links)
- The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm (Q1260623) (← links)
- A new saling algorithm for the maximum mean cut problem (Q1317477) (← links)
- Heuristic and exact algorithms for the simultaneous assignment problem (Q1572972) (← links)
- A new matching property for posets and existence of disjoint chains (Q1881683) (← links)
- Approximating the Stochastic Network by its <i>M</i> Shortest Paths (Q3415944) (← links)
- Affirmative action algorithms (Q3725860) (← links)
- Reformulating linear programs with transportation constraints-With applications to workforce scheduling (Q4651722) (← links)
- Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow (Q4796447) (← links)