331 search results - page 29 / 67 » Approximation Algorithms for Connected Dominating Sets |
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Bidimensionality theory appears to be a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
Applications such as parallel computing, online games, and content distribution networks need to run on a set of resources with particular network connection characteristics to ge...
IWPEC
2009
Springer
15 years 6 months ago
2009
Springer
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leav...
218
click to vote
CVPR
2009
IEEE
16 years 6 months ago
2009
IEEE
Markov random field (MRF, CRF) models are popular in
computer vision. However, in order to be computationally
tractable they are limited to incorporate only local interactions
a...
100
Voted
PPSN
2010
Springer
14 years 10 months ago
2010
Springer
The hypervolume indicator is widely used to guide the search and to evaluate the performance of evolutionary multi-objective optimization algorithms. It measures the volume of the ...