138 search results - page 28 / 28 » Approximation Algorithms for Bounded Degree Phylogenetic Roo... |
MOBIHOC
2005
ACM
14 years 5 months ago
2005
ACM
: In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for ...
SPAA
2003
ACM
13 years 10 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...