Stack Exchange
log in
chat
meta
about
Stack Exchange
All Sites
Hot Questions
Top Users
Newsletters
Blogs
Babak Behsaz
webdocs.cs.ualberta.ca/~behsaz
top
accounts
reputation
activity
favorites
subscriptions
Top Questions
22
votes
Compendium of the Best Approximation and Hardness Results for NP optimization problems
ds.algorithms
reference-request
approximation-algorithms
approximation-hardness
asked Feb 7 '11 at 22:23
cstheory.stackexchange.com
10
votes
3-Clique Partition for graphs of fixed diameter
cc.complexity-theory
graph-theory
np-hardness
clique
asked Mar 1 '12 at 20:37
cstheory.stackexchange.com
7
votes
Euclidean Capacitated Facility Location Problem
ds.algorithms
cg.comp-geom
approximation-algorithms
asked Jun 6 '11 at 18:38
cstheory.stackexchange.com
6
votes
Bin Packing with uniform size constraints
cc.complexity-theory
ds.algorithms
packing
asked Jun 7 '11 at 21:43
cstheory.stackexchange.com
Top Answers
7
Compendium of the Best Approximation and Hardness Results for NP optimization problems
cstheory.stackexchange.com
5
Bin Packing with uniform size constraints
cstheory.stackexchange.com
Stack Exchange works best with JavaScript enabled