Sciweavers

45 search results - page 1 / 9

» approx 2009

9

APPROX
2009
Springer

104views Algorithms» more APPROX 2009»

A Hypergraph Dictatorship Test with Perfect Completeness

13 years 11 months ago

A Hypergraph Dictatorship Test with Perfect Completeness

Download www.wisdom.weizmann.ac.il

Victor Chen

claim paper

Read More »

14

APPROX
2009
Springer

107views Algorithms» more APPROX 2009»

Extractors Using Hardness Amplification

13 years 8 months ago

Extractors Using Hardness Amplification

Download www.cs.berkeley.edu

Anindya De, Luca Trevisan

claim paper

Read More »

8

APPROX
2009
Springer

80views Algorithms» more APPROX 2009»

The Glauber Dynamics for Colourings of Bounded Degree Trees

13 years 11 months ago

The Glauber Dynamics for Colourings of Bounded Degree Trees

Download www.cs.toronto.edu

Brendan Lucier, Michael Molloy, Yuval Peres

claim paper

Read More »

10

APPROX
2009
Springer

139views Algorithms» more APPROX 2009»

Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs

13 years 11 months ago

Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs

Download www.cs.uiuc.edu

Chandra Chekuri, Alina Ene, Nitish Korula

claim paper

Read More »

16

APPROX
2009
Springer

126views Algorithms» more APPROX 2009»

On Hardness of Pricing Items for Single-Minded Bidders

13 years 11 months ago

On Hardness of Pricing Items for Single-Minded Bidders

Download www.cs.princeton.edu

Rohit Khandekar, Tracy Kimbrel, Konstantin Makaryc...

claim paper

Read More »

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