Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > SWAT ' 90: 2nd Scandinavian Workshop on Algorithm Theory. Bergen, Norway, July 11-14, 1990. Proceedings > Data structures for Traveling Salesmen
SWAT ' 90: 2nd Scandinavian Workshop on Algorithm Theory. Bergen, Norway, July 11-14, 1990. Proceedings |
John R. Gilbert; Rolf Karlsson
Springer Berlin Heidelberg
SWAT ' 90: 2nd Scandinavian Workshop on Algorithm Theory. Bergen, Norway, July 11-14, 1990. Proceedings
Data structures for Traveling Salesmen
Authors

David S. Johnson

ARI Id

1664391787689_1486693

Access

Not Available Free

Pages

287-287

DOI

10.1007/3-540-52846-6_97

Chapter URL

https://rd.springer.com/chapter/10.1007/3-540-52846-6_97

Table of Contents of Book
Showing 1 to 20 of 37 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Structural complexity theory: Recent surprises
Juris Hartmanis; Richard Chang; Desh Ranjan; Pankaj Rohatgi
1-12
Approximating maximum independent sets by excluding subgraphs
Ravi Boppana; Magnús M. Halldórsson
13-25
Generating sparse spanners for weighted graphs
Ingo Althöfer; Gautam Das; David Dobkin; Deborah Joseph
26-37
Finding the k smallest spanning trees
David Eppstein
38-47
The file distribution problem for processor networks
Goos Kant; Jan van Leeuwen
48-59
Translating polygons with applications to hidden surface removal
Mark de Berg
60-70
Output-sensitive generation of the perspective view of isothetic parallelepipeds
Franco P. Preparata; Jeffrey Scott Vitter; Mariette Yvinec
71-84
Graphics in flatland revisited
Michel Pocchiola
85-96
The visibility diagram: A data structure for visibility problems and motion planning
Gert Vegter
97-110
Fast updating of well-balanced trees
Arne Andersson; Tony W. Lai
111-121
How to update a balanced binary tree with a constant number of rotations
Thomas Ottmann; Derick Wood
122-131
Ranking trees generated by rotations
Samuel W. Bent
132-142
Expected behaviour analysis of AVL trees
Ricardo Baeza-Yates; Gaston H. Gonnet; Nivio Ziviani
143-159
Analysis of the expected search cost in skip lists
Thomas Papadakis; J. Ian Munro; Patricio V. Poblete
160-172
Lower bounds for monotonic list labeling
Paul F. Dietz; Ju Zhang
173-180
Sorting shuffled monotone sequences
Christos Levcopoulos; Ola Petersson
181-191
A faster parallel algorithm for a matrix searching problem
Mikhail J. Atallah
192-200
A rectilinear steiner minimal tree algorithm for convex point sets
Dana S. Richards; Jeffrey S. Salowe
201-212
Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric
Mark de Berg; Marc van Kreveld; Bengt J. Nilsson; Mark H. Overmars
213-224
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 37 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings