Sciweavers

77 search results - page 6 / 16
» Robust Subgraphs for Trees and Paths
Sort
View
GD
2009
Springer
13 years 12 months ago
On Planar Supports for Hypergraphs
A graph G is a support for a hypergraph H = (V, S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is co...
Kevin Buchin, Marc J. van Kreveld, Henk Meijer, Be...
CN
2007
154views more  CN 2007»
13 years 7 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
NETWORKING
2007
13 years 8 months ago
Interference-Aware Multicasting in Wireless Mesh Networks
Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shar...
Sudheendra Murthy, Abhishek Goswami, Arunabha Sen
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
14 years 1 months ago
Average-Case Analyses of Vickrey Costs
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
Prasad Chebolu, Alan M. Frieze, Páll Melste...
ICRA
2010
IEEE
159views Robotics» more  ICRA 2010»
13 years 5 months ago
An RRT-based path planner for use in trajectory imitation
We propose a more robust robot programming by demonstration system planner that produces a reproduction path which satisfies statistical constraints derived from demonstration traj...
Jonathan Claassens