3875 search results - page 350 / 775 » Approximation algorithms for the 0-extension problem |
217
click to vote
COCOA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The node-weighted Steiner tree problem is a variation of classical Steiner minimum tree problem. Given a graph G = (V, E) with node weight function C : V → R+ and a sub...
147
Voted
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
In many settings the power of truthful mechanisms is severely bounded. In this paper we use randomization to overcome this problem. In particular, we construct an FPTAS for multi-...
148
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
In many important problems, one uses the median instead of the mean to estimate a population's center, since the former is more robust. But in general, computing the median i...
188
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—This is by far the first paper considering joint optimization of link scheduling, routing and replication for disruption-tolerant networks (DTNs). The optimization problems for...
235
click to vote
STOC
2012
ACM
13 years 9 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...