4894 search results - page 100 / 979 » The Guarding Problem - Complexity and Approximation |
189
click to vote
CSCLP
2007
Springer
16 years 14 days ago
2007
Springer
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
152
click to vote
WAOA
2007
Springer
16 years 11 days ago
2007
Springer
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...
183
click to vote
ISAAC
2000
Springer
15 years 10 months ago
2000
Springer
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
192
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
152
click to vote
WEA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Extensions of the randomized tournaments techniques introduced in [6, 7] to approximate solutions of 1-median and diameter computation of finite subsets of general metri...