The following pages link to (Q4517680):
Displaying 17 items.
- Low-light trees, and tight lower bounds for Euclidean spanners (Q972609) (← links)
- Edge-disjoint spanners in tori (Q1025482) (← links)
- Least-cost network topology design for a new service: An application of tabu search (Q1179745) (← links)
- Edge-disjoint spanners of complete graphs and complete digraphs (Q1301660) (← links)
- Spanners and message distribution in networks. (Q1427197) (← links)
- A network simplex algorithm for solving the minimum distribution cost problem (Q2379832) (← links)
- Oblivious Buy-at-Bulk in Planar Graphs (Q3078378) (← links)
- (Q3178028) (← links)
- An algorithm for the minimum variance point of a network (Q3971963) (← links)
- An algorithm for generating minimum cost network flow problems with specific structure and known optimal solutions (Q4319530) (← links)
- Minimum-cost strong network orientation problems: Classification, complexity, and algorithms (Q4540090) (← links)
- Truly Optimal Euclidean Spanners (Q5071083) (← links)
- Approximation algorithms for general one-warehouse multi-retailer systems (Q5305566) (← links)
- Approximation to the Minimum Cost Edge Installation Problem (Q5387765) (← links)
- Light Spanners (Q5499739) (← links)
- Light Euclidean Spanners with Steiner Points (Q5874539) (← links)
- A branch-and-cut approach for minimum cost multi-level network design (Q5957748) (← links)
