144
Voted
FOCS
15 years 4 months ago
2004 IEEE 
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...
140
click to vote
FOCS
15 years 4 months ago
2004 IEEE
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...
128
click to vote
FOCS
15 years 4 months ago
2004 IEEE 
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
115
click to vote
FOCS
15 years 4 months ago
2004 IEEE 
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
114
Voted
FOCS
15 years 4 months ago
2004 IEEE 
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...
|
Theoretical Computer Science