136
click to vote
FOCS
15 years 3 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...
131
click to vote
FOCS
15 years 3 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 ...
122
click to vote
FOCS
15 years 3 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...
108
click to vote
FOCS
15 years 3 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...
108
click to vote
FOCS
15 years 3 months ago
2004 IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
|
Theoretical Computer Science