"An Improved Approximation Algorithm for Computing Geometric Shortest Paths"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
Investigation and implementation of an algorithm for computing optimal search paths	James F. Caldwell	1987
A decentralized algorithm for finding the shortest paths in defense communications networks	Jin Y. Yen	1979	Naval Postgraduate School
Shortest paths for line segments.	Christian Icking	1992	Courant Institute of Mathematical Sciences, New York University
Geometric Approximation Theory	Alexey R. Alimov; Igor’ G. Tsar’kov	1st ed. 2021	Springer International Publishing
On the convergence of an algorithm for rational Chebyshev approximation	Richard H. Franke	1973	Naval Postgraduate School
Modern Geometric Computing for Visualization	Tosiyasu L. Kunii	1992	Springer Japan
Modern Geometric Computing for Visualization	Tosiyasu L. Kunii; Yoshihisa Shinagawa	1992	Springer Japan
Unobstructed Shortest Paths in Polyhedral Environments	Varol Akman	1987	Springer Berlin Heidelberg
On shortest paths amidst convex polyhedra.	Micha Sharir	1985	Courant Institute of Mathematical Sciences, New York University
On shortest paths in polyhedral spaces	Micha Sharir	1984	Courant Institute of Mathematical Sciences, New York University
An algorithm for computing the alphawidth of (0, 1) matrices	Walter Lane Stanley	1965	Naval Postgraduate School
Euclidean Shortest Paths: Exact or Approximate Algorithms	Fajie Li; Reinhard Klette	2011	Springer London
On shortest paths between two convex polyhedra	Avikam Baltsan	1985	Courant Institute of Mathematical Sciences, New York University
Searching for shortest and safest paths along obstacle common tangents	Jerry Allen Crane	1991	Naval Postgraduate School;Available from the National Technical Information Service
Once Upon an Algorithm: How Stories Explain Computing	Martin Erwig	2017	MIT Press
Once upon an algorithm: how stories explain computing	Martin Erwig	2017	MIT Press
Once Upon an Algorithm: How Stories Explain Computing	Martin Erwig	2017	MIT Press,
An algorithm for constructing feasible schedules and computing their schedule times	Jack Heller	1960	Courant Institute of Mathematical Sciences, New York University
Introduction to Geometric Computing	Sherif Ghali	2008	Springer London
Directions in geometric computing /	Martin, R. R.	1993.	Information Geometers Ltd.,
Boook	Author(s)	Year	Publisher

Showing 1 to 20 of 100 entries

entries per page

Filter:

Showing 1 to 20 of 100 entries

Chapter	Author(s)	Book	Book Authors	Year	Publisher
An Improved Approximation Algorithm for Computing Geometric Shortest Paths	Lyudmil Aleksandrov; Anil Maheshwari; Jörg-Rüdiger Sack	Fundamentals of Computation Theory: 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings	Andrzej Lingas; Bengt J. Nilsson	2003	Springer Berlin Heidelberg
Improved Approximation for Time-Dependent Shortest Paths	Masoud Omran; Jörg-Rüdiger Sack	Computing and Combinatorics: 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014, Proceedings	Zhipeng Cai; Alexander Zelikovsky; Anu Bourgeois	2014	Springer International Publishing
Dijkstra's Algorithm for Shortest Paths		Applied Combinatorics	Mitchel T. Keller, William T. Trotter	2017	CreateSpace Independent Publishing Platform
Dijkstra’s Algorithm for Shortest Paths		Graph Theory	Ashay Dharwadker, Shariefuddin Pirzada	2011	CreateSpace
An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces	Lyudmil Aleksandrov; Mark Lanthier; Anil Maheshwari; Jörg -R. Sack	Algorithm Theory - SWAT' 98: 6th Scandinavian Workshop on Algorithm Theory, Stockholm, Sweden, July 8-10, 1998, Proceedings	Stefan Arnborg; Lars Ivansson	1998	Springer Berlin Heidelberg
A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths	Jonathan Backer; David Kirkpatrick	Algorithms and Computation: 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings	Seok-Hee Hong; Hiroshi Nagamochi; Takuro Fukunaga	2008	Springer Berlin Heidelberg
Example: Computing Shortest Paths		Parallel and Concurrent Programming in Haskell: Techniques for Multicore and Multithreaded Programming	Simon Marlow	2013	O'Reilly Media
Approximating Geometric Bottleneck Shortest Paths	Prosenjit Bose; 1Anil Maheshwari; Giri Narasimhan; Michiel Smid; Norbert Zeh	STACS 2003: 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003. Proceedings	Helmut Alt; Michel Habib	2003	Springer Berlin Heidelberg
An Improved Approximation Algorithm for rSPR Distance	Zhi-Zhong Chen; Eita Machida; Lusheng Wang	Computing and Combinatorics: 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings	Thang N. Dinh; My T. Thai	1st ed. 2016	Springer International Publishing
An Improved Approximation Algorithm for Combinatorial Auctions		Proceedings of the 17th annual ACM-SIAM symposium on discrete algorithms	the ACM Special Interest Group	2006	SIAM, Society for Industrial and Applied Mathematics
Dijkstra's Algorithm for Finding Shortest Paths		Practical Discrete Mathematics: Discover math principles that fuel algorithms for computer science and machine learning with Python	Ryan T. White, Archana Tikayat Ray	2021	Packt Publishing
An Iterative Algorithm for Computing Shortest Paths Through Line Segments in 3D	Le Hong Trang; Quynh Chi Truong; Tran Khanh Dang	Future Data and Security Engineering: 4th International Conference, FDSE 2017, Ho Chi Minh City, Vietnam, November 29 – December 1, 2017, Proceedings	Tran Khanh Dang; Roland Wagner; Josef Küng; Nam Thoai; Makoto Takizawa; Erich J. Neuhold	1st ed. 2017	Springer International Publishing
An approximation algorithm for computing the permanent	Leslie M. Goldschlager	Combinatorial Mathematics VII: Proceedings of the Seventh Australian Conference on Combinatorial Mathematics, Held at the University of Newcastle, Australia, August 20-24, 1979	R. W. Robinson; G. W. Southern; W. D. Wallis	1980	Springer Berlin Heidelberg
Computing Shortest Paths with Uncertainty	T. Feder; R. Motwani; L. O’Callaghan; C. Olston; R. Panigrahy	STACS 2003: 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003. Proceedings	Helmut Alt; Michel Habib	2003	Springer Berlin Heidelberg
Computing Homotopic Shortest Paths Efficiently	Alon Efrat; Stephen G. Kobourov; Anna Lubiw	Algorithms - ESA 2002: 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings	Rolf Möhring; Rajeev Raman	2002	Springer Berlin Heidelberg
Computing Shortest Paths in Networks	E. L. Lawler	Topics in Combinatorial Optimization	Sergio Rinaldi	1975	Springer Vienna
Computing Homotopic Shortest Paths Efficient		Algorithms — ESA 2002: 10th Annual European Symposium Rome, Italy, September 17–21, 2002 Proceedings	William Cook (auth.), Rolf Möhring, Rajeev Raman (eds.)	2002	Springer-Verlag Berlin Heidelberg
96 Warshall's Algorithm, Shortest Paths		Schaum's Outline of Discrete Mathematics	Seymour Lipschutz, Marc Lipson	2007	McGraw-Hill
Shortest Paths and Algorithm Complexity		Discrete Mathematics	Professor Arthur T. Benjamin, The Teaching Company	2009	n/a
Geometric Shortest Paths in the Plane	John Hershberger	Encyclopedia of Algorithms	Ming-Yang Kao	2nd ed. 2016	Springer New York
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"An Improved Approximation Algorithm for Computing Geometric Shortest Paths" - similar Books and Chapters