Sciweavers

68 search results - page 4 / 14

» focs 2007

13

FOCS
2007
IEEE

113views Theoretical Computer Science» more FOCS 2007»

Balloon Popping With Applications to Ascending Auctions

14 years 1 months ago

Balloon Popping With Applications to Ascending Auctions

Download www.eecs.northwestern.edu

Nicole Immorlica, Anna R. Karlin, Mohammad Mahdian...

claim paper

Read More »

12

FOCS
2007
IEEE

84views Theoretical Computer Science» more FOCS 2007»

Non-Preemptive Min-Sum Scheduling with Resource Augmentation

14 years 1 months ago

Non-Preemptive Min-Sum Scheduling with Resource Augmentation

Download domino.research.ibm.com

Nikhil Bansal, Ho-Leung Chan, Rohit Khandekar, Kir...

claim paper

Read More »

14

FOCS
2007
IEEE

72views Theoretical Computer Science» more FOCS 2007»

Testing for Concise Representations

14 years 1 months ago

Testing for Concise Representations

Download people.csail.mit.edu

Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, K...

claim paper

Read More »

20

FOCS
2007
IEEE

129views Theoretical Computer Science» more FOCS 2007»

Local Global Tradeoffs in Metric Embeddings

13 years 11 months ago

Local Global Tradeoffs in Metric Embeddings

Download www.cs.princeton.edu

Suppose that every k points in a n point metric space X are D-distortion embed

Moses Charikar, Konstantin Makarychev, Yury Makary...

claim paper

Read More »

23

FOCS
2007
IEEE

135views Theoretical Computer Science» more FOCS 2007»

On the Advantage over Random for Maximum Acyclic Subgraph

14 years 1 months ago

On the Advantage over Random for Maximum Acyclic Subgraph

Download www.cs.princeton.edu

In this paper we present a new approximation algorithm for the Max Acyclic Subgraph problem. Given an instance where the maximum acyclic subgraph contains 1/2 + δ fraction of all...

Moses Charikar, Konstantin Makarychev, Yury Makary...

claim paper

Read More »

« Prev « First page 4 / 14 Last » Next »