Sciweavers

434 search results - page 31 / 87
» Improved Algorithms for the 2-Vertex Disjoint Paths Problem
Sort
View
88
Voted
IJCGA
2008
114views more  IJCGA 2008»
14 years 9 months ago
Fixed Parameter Algorithms for the Minimum Weight Triangulation Problem
Published as Technical Report LU-CS-TR:2005-238 on February 13, 2006, ISSN 1650-1276 Report 158, Lund University, Sweden 2006 We discuss and compare four fixed parameter algorithm...
Magdalene G. Borgelt, Christian Borgelt, Christos ...
72
Voted
ICANNGA
2007
Springer
133views Algorithms» more  ICANNGA 2007»
15 years 3 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
72
Voted
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
15 years 9 months ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano
ESA
2008
Springer
137views Algorithms» more  ESA 2008»
14 years 11 months ago
Flexible Path Planning Using Corridor Maps
Path planning is a central problem in virtual environments and games. When computer-controlled characters move around in virtual worlds they have to plan their paths to desired loc...
Mark H. Overmars, Ioannis Karamouzas, Roland Gerae...
EOR
2008
75views more  EOR 2008»
14 years 9 months ago
GRASP and path relinking for project scheduling under partially renewable resources
Recently, in the field of project scheduling problems the concept of partially renewable resources has been introduced. Theoretically, it is a generalization of both renewable and...
Ramón Alvarez-Valdés, Enric Crespo, ...