35 search results - page 1 / 7 » When crossings count - approximating the minimum spanning tr... |
IV
2002
IEEE
13 years 9 months ago
2002
IEEE
Visualization can facilitate the understanding of the structures of a collection of documents that are related to each other by links, such as citations in formal publications. We...
SOFSEM
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
CCCG
2003
13 years 6 months ago
2003
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....
PODC
2009
ACM
14 years 5 months ago
2009
ACM
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...
NETWORKS
2008
13 years 4 months ago
2008
Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so tha...