Sciweavers

172 search results - page 35 / 35
» Improved Approximation Algorithms for Maximum Lifetime Probl...
Sort
View
SPAA
2003
ACM
13 years 10 months ago
Short length menger's theorem and reliable optical routing
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...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
COCOA
2009
Springer
13 years 10 months ago
On Open Rectangle-of-Influence Drawings of Planar Graphs
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
Huaming Zhang, Milind Vaidya