352 search results - page 39 / 71 » Experimental Analysis of Approximation Algorithms for the Ve... |
MOBIHOC
2006
ACM
14 years 7 months ago
2006
ACM
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...
EOR
2010
13 years 5 months ago
2010
: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by th...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...
CCCG
2007
13 years 9 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...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...