The following pages link to (Q4763403):
Displaying 19 items.
- A distributed fault identification protocol for wireless and mobile ad hoc networks (Q436706) (← links)
- Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem (Q633844) (← links)
- Diagnosing infeasibilities in network flow problems (Q1290604) (← links)
- Minimizing symmetric submodular functions (Q1290631) (← links)
- The asymmetric traveling salesman problem with replenishment arcs (Q1569947) (← links)
- A note on optimal covering augmentation for graphic polymatroids. (Q1603399) (← links)
- Binary Steiner trees: structural results and an exact solution approach (Q1751166) (← links)
- Implementing an efficient minimum capacity cut algorithm (Q1804650) (← links)
- A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms (Q1917270) (← links)
- On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms (Q2241575) (← links)
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut (Q2583145) (← links)
- A simple and fast min-cut algorithm (Q2642908) (← links)
- A branch-and-cut algorithm for the preemptive swapping problem (Q2913951) (← links)
- On Element-Connectivity Preserving Graph Simplification (Q3452796) (← links)
- Efficient algorithms for minimum range cut problems (Q4313630) (← links)
- Practical Minimum Cut Algorithms (Q4629534) (← links)
- Separating maximally violated comb inequalities in planar graphs (Q4645943) (← links)
- A branch‐and‐cut algorithm for the nonpreemptive swapping problem (Q5187945) (← links)
- Vertex covering with capacitated trees (Q6179715) (← links)
