192 search results - page 27 / 39 » A Constant-Factor Approximation Algorithm for the Multicommo... |
123
click to vote
SPIRE
2010
Springer
15 years 27 days ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
147
Voted
WAOA
2005
Springer
15 years 8 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
143
Voted
WAOA
2010
Springer
15 years 11 days ago
2010
Springer
We study an extension of the unit-demand pricing problem in which the seller may offer bundles of items. If a customer buys such a bundle she is guaranteed to get one item out of i...
113
click to vote
TOC
2008
15 years 2 months ago
2008
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
120
Voted
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract—In this paper, we develop passive network tomography techniques for inferring link-level anomalies like excessive loss rates and delay from path-level measurements. Our ...