STOC 2006 | Sciweavers

29

click to vote

STOC
2006
ACM

57views Algorithms» more STOC 2006»

Integrality gaps for sparsest cut and minimum linear arrangement problems

14 years 12 months ago

Download www.cc.gatech.edu

Nikhil R. Devanur, Subhash Khot, Rishi Saket, Nish...

claim paper

Read More »

44

click to vote

STOC
2006
ACM

130views Algorithms» more STOC 2006»

Online trading algorithms and robust option pricing

14 years 12 months ago

Download www.math.tau.ac.il

In this work we show how to use efficient online trading algorithms to price the current value of financial instruments, such as an option. We derive both upper and lower bounds f...

Peter DeMarzo, Ilan Kremer, Yishay Mansour

claim paper

Read More »

39

click to vote

STOC
2006
ACM

129views Algorithms» more STOC 2006»

Optimal phylogenetic reconstruction

14 years 12 months ago

Download www.stat.berkeley.edu

One of the major tasks of evolutionary biology is the reconstruction of phylogenetic trees from molecular data. The evolutionary model is given by a Markov chain on the true evolu...

Constantinos Daskalakis, Elchanan Mossel, Sé...

claim paper

Read More »

29

click to vote

STOC
2006
ACM

130views Algorithms» more STOC 2006»

The complexity of computing a Nash equilibrium

14 years 12 months ago

Download www.cs.berkeley.edu

Constantinos Daskalakis, Paul W. Goldberg, Christo...

claim paper

Read More »

43

click to vote

STOC
2006
ACM

138views Algorithms» more STOC 2006»

Searching dynamic point sets in spaces with bounded doubling dimension

14 years 12 months ago

Download cs.nyu.edu

We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...

Richard Cole, Lee-Ad Gottlieb

claim paper

Read More »

31

click to vote

STOC
2006
ACM

122views Algorithms» more STOC 2006»

Hardness of cut problems in directed graphs

14 years 12 months ago

Download www.cis.upenn.edu

Julia Chuzhoy, Sanjeev Khanna

claim paper

Read More »

34

click to vote

STOC
2006
ACM

180views Algorithms» more STOC 2006»

Pricing for fairness: distributed resource allocation for multiple objectives

14 years 12 months ago

Download www.stanford.edu

In this paper, we present a simple distributed algorithm for resource allocation which simultaneously approximates the optimum value for a large class of objective functions. In p...

Sung-woo Cho, Ashish Goel

claim paper

Read More »

43

click to vote

STOC
2006
ACM

174views Algorithms» more STOC 2006»

Edge-disjoint paths in Planar graphs with constant congestion

14 years 12 months ago

Download www.cis.upenn.edu

We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...

Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd

claim paper

Read More »

41

click to vote

STOC
2006
ACM

132views Algorithms» more STOC 2006»

Near-optimal algorithms for unique games

14 years 12 months ago

Download www.cs.princeton.edu

Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...

Moses Charikar, Konstantin Makarychev, Yury Makary...

claim paper

Read More »

17

click to vote

STOC
2006
ACM

108views Algorithms» more STOC 2006»

Graph limits and parameter testing

14 years 12 months ago