<--- Back to Details
First PageDocument Content
NP-complete problems / Approximation algorithms / Operations research / Facility location problem / Combinatorial optimization / Steiner tree problem / APX / Draft:Sub-linear time algorithm / Planar separator theorem
Date: 2013-11-01 17:11:36
NP-complete problems
Approximation algorithms
Operations research
Facility location problem
Combinatorial optimization
Steiner tree problem
APX
Draft:Sub-linear time algorithm
Planar separator theorem

Approximation Algorithms for Single and Multi-Commodity Connected Facility Location Fabrizio Grandoni & Thomas Rothvoß Department of Mathematics, M.I.T.

Add to Reading List

Source URL: www.math.washington.edu

Download Document from Source Website

File Size: 342,00 KB

Share Document on Facebook

Similar Documents