<--- Back to Details
First PageDocument Content
Graph theory / Mathematics / Computational complexity theory / NP-complete problems / Steiner tree problem / XTR / Shortest path problem / Flow network / Maximum flow problem / Graph coloring
Date: 2004-09-21 15:30:39
Graph theory
Mathematics
Computational complexity theory
NP-complete problems
Steiner tree problem
XTR
Shortest path problem
Flow network
Maximum flow problem
Graph coloring

Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Anupam Gupta∗ Amit Kumar†

Add to Reading List

Source URL: theory.stanford.edu

Download Document from Source Website

File Size: 129,89 KB

Share Document on Facebook

Similar Documents