599 search results - page 51 / 120 » Approximation Algorithms for Dominating Set in Disk Graphs |
CPM
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...
JAL
2006
14 years 9 months ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
ESA
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
GBRPR
2009
Springer
15 years 2 months ago
2009
Springer
The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Ne...
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...