7006 search results - page 631 / 1402 » Approximation Algorithms |
259
Voted
IPL
2006
15 years 7 months ago
2006
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
123
click to vote
ICRA
2009
IEEE
16 years 2 months ago
2009
IEEE
— We explore the interconnection between search and action in the context of mobile robotics. The task of searching for an object and then performing some action with that object...
190
click to vote
CCCG
1994
15 years 8 months ago
1994
We formulate the problem of computing the widest empty corridor with at most ` links and right-angle turns for a set of n points. It is a generalization of the widest empty corrid...
188
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We consider the problem of maximizing welfare when allocating m items to n players with subadditive utility functions. Our main result is a way of rounding any fractional solution...
197
click to vote
TMI
2010
15 years 5 months ago
2010
—Several different reconstruction algorithms have been proposed for photoacoustic tomography, most of which presuppose that the acoustic properties of the medium are constant and...