599 search results - page 47 / 120 » Approximation Algorithms for Dominating Set in Disk Graphs |
SMA
2008
ACM
14 years 9 months ago
2008
ACM
In this paper we consider the problem of monitoring an art gallery modeled as a polygon, the edges of which are arcs of curves. We consider two types of guards: edge guards (these...
94
Voted
BMCBI
2010
14 years 9 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
In many physical statistical, biological and other investigations it is desirable to approximate a system of points by objects of lower dimension and/or complexity. For this purpo...
WADS
2007
Springer
15 years 3 months ago
2007
Springer
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...
102
click to vote
ACMSE
2007
ACM
15 years 1 months ago
2007
ACM
Network wide broadcasting in ad-hoc wireless networks provides important control and route establishment functionality for a number of unicast and multicast protocols. In broadcas...