Sciweavers

STOC
2006
ACM
57views Algorithms» more  STOC 2006»
14 years 4 months ago
Integrality gaps for sparsest cut and minimum linear arrangement problems
Nikhil R. Devanur, Subhash Khot, Rishi Saket, Nish...
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
14 years 4 months ago
Online trading algorithms and robust option pricing
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
STOC
2006
ACM
129views Algorithms» more  STOC 2006»
14 years 4 months ago
Optimal phylogenetic reconstruction
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é...
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
14 years 4 months ago
The complexity of computing a Nash equilibrium
Constantinos Daskalakis, Paul W. Goldberg, Christo...
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 4 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
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
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
14 years 4 months ago
Hardness of cut problems in directed graphs
Julia Chuzhoy, Sanjeev Khanna
STOC
2006
ACM
180views Algorithms» more  STOC 2006»
14 years 4 months ago
Pricing for fairness: distributed resource allocation for multiple objectives
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
STOC
2006
ACM
174views Algorithms» more  STOC 2006»
14 years 4 months ago
Edge-disjoint paths in Planar graphs with constant congestion
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
STOC
2006
ACM
132views Algorithms» more  STOC 2006»
14 years 4 months ago
Near-optimal algorithms for unique games
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...
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
14 years 4 months ago
Graph limits and parameter testing
Christian Borgs, Jennifer T. Chayes, Lászl&...