Sciweavers

51 search results - page 1 / 11

» approx 2008

8

APPROX
2008
Springer

94views Algorithms» more APPROX 2008»

Budgeted Allocations in the Full-Information Setting

13 years 6 months ago

Budgeted Allocations in the Full-Information Setting

Download www.cs.umd.edu

Aravind Srinivasan

claim paper

Read More »

7

APPROX
2008
Springer

83views Algorithms» more APPROX 2008»

Near Optimal Dimensionality Reductions That Preserve Volumes

13 years 6 months ago

Near Optimal Dimensionality Reductions That Preserve Volumes

Download www.cs.toronto.edu

Avner Magen, Anastasios Zouzias

claim paper

Read More »

10

APPROX
2008
Springer

79views Algorithms» more APPROX 2008»

Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size

13 years 6 months ago

Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size

Download www.imsc.res.in

Vikraman Arvind, Partha Mukhopadhyay

claim paper

Read More »

18

APPROX
2008
Springer

128views Algorithms» more APPROX 2008»

Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness

13 years 6 months ago

Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness

Download www.cs.cmu.edu

Venkatesan Guruswami, Prasad Raghavendra

claim paper

Read More »

10

APPROX
2008
Springer

108views Algorithms» more APPROX 2008»

Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP

13 years 6 months ago

Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP

Download people.csail.mit.edu

David R. Karger, Jacob Scott

claim paper

Read More »

« Prev « First page 1 / 11 Last » Next »