7006 search results - page 446 / 1402 » Approximation Algorithms |
312
Voted
INFOCOM
2012
IEEE
13 years 7 months ago
2012
IEEE
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...
123
click to vote
ICCV
2009
IEEE
15 years 2 months ago
2009
IEEE
In this work we revisit the Mumford-Shah functional, one of the most studied variational approaches to image segmentation. The contribution of this paper is to propose an algorith...
158
click to vote
SIAMCOMP
2010
15 years 3 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
146
click to vote
AMC
2006
15 years 5 months ago
2006
This paper considers an extension of a vehicle routing problem with backhauls (VRPB). In this problem, a set of costumers are divided in two subsets consisting of linehaul and bac...
172
Voted
SWAT
2010
Springer
15 years 2 months ago
2010
Springer
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...