2137 search results - page 109 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
144
click to vote
COMPGEOM
2006
ACM
16 years 19 days ago
2006
ACM
We consider the problem of balancing the load among m service-providing facilities, while keeping the total cost low. Let R be the underlying demand region, and let p1, . . . , pm...
198
click to vote
ICPP
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— We examine the problem of parallelizing the inferencing process for OWL knowledge-bases. A key challenge in this problem is partitioning the computational workload of t...
182
click to vote
SIAMCOMP
2010
15 years 5 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...
198
click to vote
INFOCOM
2007
IEEE
16 years 29 days ago
2007
IEEE
— Two fundamental functions of the sensor nodes in a wireless sensor network are to sense its environment and to transmit sensed information to a basestation. One approach to pro...
137
click to vote
FOCS
2003
IEEE
15 years 12 months ago
2003
IEEE
In this paper, we give the rst constant-factor approximationalgorithmfor the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivate...