Sciweavers

Share
AMAI
2008
Springer
9 years 7 days ago
The giving tree: constructing trees for efficient offline and online multi-robot coverage
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 ...
Noa Agmon, Noam Hazon, Gal A. Kaminka
ALGORITHMICA
2008
63views more  ALGORITHMICA 2008»
9 years 7 days ago
The Swap Edges of a Multiple-Sources Routing Tree
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 ...
Bang Ye Wu, Chih-Yuan Hsiao, Kun-Mao Chao
WSS
1997
112views Control Systems» more  WSS 1997»
9 years 1 months ago
Propagated timestamps: a scheme for the stabilization of maximum-flow routing protocols
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...
Jorge Arturo Cobb, Mohamed Waris
IADIS
2003
9 years 1 months ago
Generating Guided Tours over Indexed Information Resources
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...
Benjamin Buffereau, Pierre Duchet, Philippe Picoue...
OPODIS
2004
9 years 1 months ago
A Dynamic Reconfiguration Tolerant Self-stabilizing Token Circulation Algorithm in Ad-Hoc Networks
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...
Hirotsugu Kakugawa, Masafumi Yamashita
NIPS
2008
9 years 1 months ago
Fast Prediction on a Tree
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
Mark Herbster, Massimiliano Pontil, Sergio Rojas G...
CCCG
2007
9 years 1 months ago
Approximating k-hop Minimum Spanning Trees in Euclidean Metrics
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...
Sören Laue, Domagoj Matijevic
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
9 years 1 months ago
Symmetric range assignment with disjoint MST constraints
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}...
Eric Schmutz
AAIM
2010
Springer
155views Algorithms» more  AAIM 2010»
9 years 3 months ago
The (K, k)-Capacitated Spanning Tree Problem
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...
Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin
LATIN
1995
Springer
9 years 3 months ago
Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs
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...
David Fernández-Baca, Giora Slutzki
books