743 search results - page 86 / 149 » Approximation Algorithms for Graph Homomorphism Problems |
144
Voted
PVLDB
2010
15 years 2 months ago
2010
This paper introduces a new definition of dense subgraph pattern, the DN-graph. DN-graph considers both the size of the sub-structure and the minimum level of interactions betwee...
148
click to vote
ESA
2008
Springer
15 years 5 months ago
2008
Springer
Metric Labeling problems have been introduced as a model for understanding noisy data with pair-wise relations between the data points. One application of labeling problems with pa...
111
click to vote
FOCS
1998
IEEE
15 years 8 months ago
1998
IEEE
In the Finite Capacity Dial-a-Ride problem the input is a metric space, a set of objects {di}, each specifying a source si and a destination ti, and an integer k--the capacity of t...
133
click to vote
CCCG
2007
15 years 5 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
145
click to vote
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...