114 search results - page 13 / 23 » Approximation Algorithms for Unit Disk Graphs |
WDAG
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
PDP
2007
IEEE
14 years 2 months ago
2007
IEEE
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...
COMCOM
2006
13 years 8 months ago
2006
Routing is the problem of sending a packet from a source node to a destination node in the network. Existing solutions for sensor networks assume a unit disk graph model, where me...
ICALP
2001
Springer
14 years 16 days ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
COCOA
2009
Springer
13 years 11 months ago
2009
Springer
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...