Sciweavers

109 search results - page 13 / 22
» An Approximation Algorithm for Shortest Descending Paths
Sort
View
FOCS
2009
IEEE
15 years 6 months ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...
CG
2005
Springer
14 years 11 months ago
Computing geodesics on triangular meshes
We present a new algorithm to compute a geodesic path over a triangulated surface. Based on Sethian's Fast Marching Method and Polthier's Straightest Geodesics theory, w...
Dimas Martínez Morera, Luiz Velho, Paulo Ce...
INFOCOM
2003
IEEE
15 years 5 months ago
Algorithms for Computing QoS Paths with Restoration
— There is a growing interest among service providers to offer new services with Quality of Service (QoS) guaranties that are also resilient to failures. Supporting QoS connectio...
Yigal Bejerano, Yuri Breitbart, Rajeev Rastogi, Al...
ICANNGA
2007
Springer
133views Algorithms» more  ICANNGA 2007»
15 years 5 months ago
Finding the Optimal Path in 3D Spaces Using EDAs - The Wireless Sensor Networks Scenario
Abstract. In wireless sensor networks where sensors are geographically deployed in 3D spaces, a mobile robot is required to travel to each sensor in order to download the data. The...
Bo Yuan, Maria E. Orlowska, Shazia Wasim Sadiq
STOC
2003
ACM
153views Algorithms» more  STOC 2003»
16 years 21 hour ago
Sublinear geometric algorithms
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
Bernard Chazelle, Ding Liu, Avner Magen