Back to Results
First PageMeta Content
Spanning tree / NP-complete problems / Routing algorithms / Edsger W. Dijkstra / Combinatorial optimization / Steiner tree problem / Minimum spanning tree / Shortest path problem / Eulerian path / Algorithm / Randomized algorithm / Matching


Simpler and Better Approximation Algorithms for Network Design Anupam Gupta∗ Amit Kumar†
Add to Reading List

Document Date: 2005-11-30 21:17:11

Open Document

File Size: 119,47 KB

Share Result on Facebook