Sciweavers

326 search results - page 48 / 66
» The Minimum-Area Spanning Tree Problem
Sort
View
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
14 years 4 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...
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
14 years 1 months ago
Biobjective evolutionary and heuristic algorithms for intersection of geometric graphs
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
Rajeev Kumar, Pramod Kumar Singh, Bhargab B. Bhatt...
IROS
2007
IEEE
159views Robotics» more  IROS 2007»
14 years 4 months ago
Approximate covariance estimation in graphical approaches to SLAM
— Smoothing and optimization approaches are an effective means for solving the simultaneous localization and mapping (SLAM) problem. Most of the existing techniques focus mainly ...
Gian Diego Tipaldi, Giorgio Grisetti, Wolfram Burg...
SOFSEM
1997
Springer
14 years 2 months ago
Time Optimal Self-Stabilizing Algorithms
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
Rastislav Kralovic
NETWORKING
2008
13 years 11 months ago
A Distributed Algorithm for Overlay Backbone Multicast Routing in Content Delivery Networks
Abstract. To support large-scale live Internet broadcasting services efficiently in content delivery networks (CDNs), it is essential to exploit peer-to-peer capabilities among end...
Jun Guo, Sanjay Jha