AMAI
2008
Springer
13 years 12 months ago
2008
Springer
This paper discusses the problem of building efficient coverage paths for a team of robots. An efficient multi-robot coverage algorithm should result in a coverage path for every ...
ALGORITHMICA
2008
13 years 12 months ago
2008
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...
WSS
1997
14 years 1 months ago
1997
We present a distributed protocol for maintaining a maximum flow spanning tree in a network, with a designated node as the root of the tree. This maximum flow spanning tree can be...
IADIS
2003
14 years 1 months ago
2003
This article proposes an approach to the generation of guided tours over indexed information resources on user demand. It represents an alternative to more sophisticated hyperdocu...
OPODIS
2004
14 years 1 months ago
2004
Abstract. Ad-hoc networks do not provide an infrastructure for communication such as routers and are characterized by 1) quick changes of communication topology and 2) unstable sys...
NIPS
2008
14 years 1 months ago
2008
Given an n-vertex weighted tree with structural diameter S and a subset of m vertices, we present a technique to compute a corresponding m
CCCG
2007
14 years 1 months ago
2007
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...
DIALM
2008
ACM
14 years 1 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
AAIM
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. This paper considers a generalization of the capacitated spanning tree, in which some of the nodes have capacity K, and the others have capacity k < K. We prove that t...
LATIN
1995
Springer
14 years 3 months ago
1995
Springer
A linear-time algorithm for the minimum-ratio spanning tree problem on planar graphs is presented. The algorithm is based on a new planar minimum spanning tree algorithm. The appr...