Computing Homotopic Shortest Paths Efficiently (English)
- New search for: Efrat, Alon
- New search for: Kobourov, Stephen G.
- New search for: Lubiw, Anna
- New search for: Efrat, Alon
- New search for: Kobourov, Stephen G.
- New search for: Lubiw, Anna
In:
Algorithms — ESA 2002
2
;
411-423
;
2002
-
ISSN:
- Article/Chapter (Book) / Electronic Resource
-
Title:Computing Homotopic Shortest Paths Efficiently
-
Contributors:
-
Published in:Algorithms — ESA 2002 , 2 ; 411-423Lecture Notes in Computer Science ; 2461, 2 ; 411-423
-
Publisher:
- New search for: Springer Berlin Heidelberg
-
Place of publication:Berlin, Heidelberg
-
Publication date:2002-01-01
-
Size:13 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Article/Chapter (Book)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents eBook
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Solving Traveling Salesman ProblemsCook, William et al. | 2002
- 2
-
Computing Shapes from Point Cloud DataDey, Tamal K. et al. | 2002
- 3
-
Mechanism Design for Fun and ProfitKarlin, Anna R. et al. | 2002
- 4
-
On Distance Oracles and Routing in GraphsThorup, Mikkel et al. | 2002
- 5
-
Kinetic Medians and kd-TreesAgarwal, Pankaj K. / Gao, Jie / Guibas, Leonidas J. et al. | 2002
- 6
-
Range Searching in Categorical Data: Colored Range Searching on GridAgarwal, Pankaj K. / Govindarajan, Sathish / Muthukrishnan, S. et al. | 2002
- 7
-
Near-Linear Time Approximation Algorithms for Curve SimplificationAgarwal, Pankaj K. / Har-Peled, Sariel / Mustafa, Nabil H. / Wang, Yusu et al. | 2002
- 8
-
Translating a Planar Object to Maximize Point ContainmentAgarwal, Pankaj K. / Hagerup, Torben / Ray, Rahul / Sharir, Micha / Smid, Michiel / Welzl, Emo et al. | 2002
- 9
-
Approximation Algorithms for k-Line CenterAgarwal, Pankaj K. / Procopiuc, Cecilia M. / Varadarajan, Kasturi R. et al. | 2002
- 64
-
New Heuristics and Lower Bounds for the Min-Max k-Chinese Postman ProblemAhr, Dino / Reinelt, Gerhard et al. | 2002
- 75
-
SCIL — Symbolic Constraints in Integer Linear ProgrammingAlthaus, Ernst / Bockmayr, Alexander / Elf, Matthias / Jünger, Michael / Kasper, Thomas / Mehlhorn, Kurt et al. | 2002
- 88
-
Implementing I/O-efficient Data Structures Using TPIEArge, Lars / Procopiuc, Octavian / Scott Vitter, Jeffrey et al. | 2002
- 101
-
On the k-Splittable Flow ProblemBaier, Georg / Köhler, Ekkehard / Skutella, Martin et al. | 2002
- 114
-
Partial Alphabetic TreesBarkan, Arye / Kaplan, Haim et al. | 2002
- 126
-
Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS RouterBarrett, Chris / Bisset, Keith / Jacob, Riko / Konjevod, Goran / Marathe, Madhav et al. | 2002
- 139
-
Scanning and Traversing: Maintaining Data for Traversals in a Memory HierarchyBender, Michael A. / Cole, Richard / Demaine, Erik D. / Farach-Colton, 4Martin et al. | 2002
- 152
-
Two Simplified Algorithms for Maintaining Order in a ListBender, Michael A. / Cole, Richard / Demaine, Erik D. / Farach-Colton, Martin / Zito, Jack et al. | 2002
- 165
-
Efficient Tree Layout in a Multilevel Memory HierarchyBender, Michael A. / Demaine, Erik D. / Farach-Colton, Martin et al. | 2002
- 174
-
A Computational Basis for Conic Arcs and Boolean Operations on Conic PolygonsBerberich, Eric / Eigenwillig, Arno / Hemmer, Michael / Hert, Susan / Mehlhorn, Kurt / Schömer, Elmar et al. | 2002
- 187
-
TSP with Neighborhoods of Varying SizeBerg, Mark / Gudmundsson, Joachim / Katz, Matthew J. / Levcopoulos, Christos / Overmars, Mark H. / Frank der Stappen, A. et al. | 2002
- 200
-
1.375-Approximation Algorithm for Sorting by ReversalsBerman, Piotr / Hannenhalli, Sridhar / Karpinski, Marek et al. | 2002
- 211
-
Radio Labeling with Pre-assigned FrequenciesBodlaender, Hans L. / Broersma, Hajo / Fomin, Fedor V. / Pyatkin, Artem V. / Woeginger, Gerhard J. et al. | 2002
- 223
-
Branch-and-Bound Algorithms for the Test Cover ProblemBontridder, Koen M. J. / Lageweg, B. J. / Lenstra, Jan K. / Orlin, James B. / Stougie, Leen et al. | 2002
- 234
-
Constructing Plane Spanners of Bounded Degree and Low WeightBose, Prosenjit / Gudmundsson, Joachim / Smid, Michiel et al. | 2002
- 247
-
Eager st-OrderingBrandes, Ulrik et al. | 2002
- 257
-
Three-Dimensional Layers of MaximaBuchsbaum, Adam L. / Goodrich, Michael T. et al. | 2002
- 270
-
Optimal Terrain Construction Problems and Applications in Intensity-Modulated Radiation TherapyChen, Danny Z. / Hu, Xiaobo S. / Luan, Shuang / Wu, Xiaodong / Yu, Cedric X. et al. | 2002
- 284
-
Geometric Algorithms for Density-Based Data ClusteringChen, Danny Z. / Smid, Michiel / Xu, Bin et al. | 2002
- 297
-
Balanced-Replication Algorithms for Distribution TreesCohen, Edith / Kaplan, Haim et al. | 2002
- 310
-
Butterflies and Peer-to-Peer NetworksDatar, Mayur et al. | 2002
- 323
-
Estimating Rarity and Similarity over Data Stream WindowsDatar, Mayur / Muthukrishnan, S. et al. | 2002
- 335
-
Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access ChannelsBonis, Annalisa / Vaccaro, Ugo et al. | 2002
- 348
-
Frequency Estimation of Internet Packet Streams with Limited SpaceDemaine, Erik D. / López-Ortiz, Alejandro / Munro, J. Ian et al. | 2002
- 361
-
Truthful and Competitive Double AuctionsDeshmukh, Kaustubh / Goldberg, Andrew V. / Hartline, Jason D. / Karlin, Anna R. et al. | 2002
- 374
-
Optimal Graph Exploration without Good MapsDessmark, Anders / Pelc, Andrzej et al. | 2002
- 387
-
Approximating the Medial Axis from the Voronoi Diagram with a Convergence GuaranteeDey, Tamal K. / Zhao, Wulue et al. | 2002
- 399
-
Non-independent Randomized Rounding and an Application to Digital HalftoningDoerr, Benjamin / Schnieder, Henning et al. | 2002
- 411
-
Computing Homotopic Shortest Paths EfficientlyEfrat, Alon / Kobourov, Stephen G. / Lubiw, Anna et al. | 2002
- 424
-
An Algorithm for Dualization in Products of Lattices and Its ApplicationsElbassioni, Khaled M. et al. | 2002
- 436
-
Determining Similarity of Conformational PolymorphsEnosh, Angela / Kedem, Klara / Bernstein, Joel et al. | 2002
- 449
-
Minimizing the Maximum Starting Time On-lineEpstein, Leah / Stee, Rob et al. | 2002
- 461
-
Vector Assignment Problems: A General FrameworkEpstein, Leah / Tassa, Tamir et al. | 2002
- 473
-
Speeding Up the Incremental Construction of the Union of Geometric Objects in PracticeEzra, Eti / Halperin, Dan / Sharir, Micha et al. | 2002
- 485
-
Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum CliqueFahle, Torsten et al. | 2002
- 499
-
Online Companion CachingFiat, Amos / Mendel, Manor / Seiden, Steven S. et al. | 2002
- 512
-
Deterministic Communication in Radio Networks with Large LabelsGaşieniec, Leszek / Pagourtzis, Aris / Potapov, Igor et al. | 2002
- 525
-
A Primal Approach to the Stable Set ProblemGentile, Claudio / Utz-Uwe, Haus / Köppe, Matthias / Rinaldi, Giovanni / Weismantel, Robert et al. | 2002
- 538
-
Wide-Sense Nonblocking WDM Cross-ConnectsHaxell, Penny / Rasala, April / Wilfong, Gordon / Winkler, Peter et al. | 2002
- 550
-
Efficient Implementation of a Minimal Triangulation AlgorithmHeggernes, Pinar / Villanger, Yngve et al. | 2002
- 562
-
Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation SchemeJansen, Klaus et al. | 2002
- 574
-
The Probabilistic Analysis of a Greedy Satisfiability AlgorithmKaporis, Alexis C. / Kirousis, Lefteris M. / Lalas, Efthimios G. et al. | 2002
- 586
-
Dynamic Additively Weighted Voronoi Diagrams in 2DKaravelas, Menelaos I. / Yvinec, Mariette et al. | 2002
- 599
-
Time-Expanded Graphs for Flow-Dependent Transit TimesKöhler, Ekkehard / Langkau, Katharina / Skutella, Martin et al. | 2002
- 612
-
Partially-Ordered Knapsack and Applications to SchedulingKolliopoulos, Stavros G. / Steiner, George et al. | 2002
- 625
-
A Software Library for Elliptic Curve CryptographyKonstantinou, Elisavet / Stamatiou, Yiannis / Zaroliagis, Christos et al. | 2002
- 637
-
Real-Time Dispatching of Guided and Unguided Automobile Service Units with Soft Time WindowsKrumke, Sven O. / Rambau, Jörg / Torres, Luis M. et al. | 2002
- 57
-
Randomized Approximation Algorithms for Query Optimization Problems on Two ProcessorsLaber, Eduardo / Parekh, Ojas / Ravi, R. et al. | 2002
- 662
-
Covering Things with ThingsLangerman, Stefan / Morin, Pat et al. | 2002
- 674
-
On-Line Dial-a-Ride Problems under a Restricted Information ModelLipmann, Maarten / Lu, X. / Paepe, Willem E. / Sitters, Rene A. / Stougie, Leen et al. | 2002
- 686
-
Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic GraphsLoryś, Krzysztof / Zwoźniak, Grażyna et al. | 2002
- 698
-
Engineering a Lightweight Suffix Array Construction AlgorithmManzini, Giovanni / Ferragina, Paolo et al. | 2002
- 62
-
Complexity of Compatible Decompositions of Eulerian Graphs and Their TransformationsMaxová, Jana / Nešetřil, Jaroslav et al. | 2002
- 63
-
External-Memory Breadth-First Search with Sublinear I/OMehlhorn, Kurt / Meyer, Ulrich et al. | 2002
- 64
-
Frequency Channel Assignment on Planar NetworksMolloy, Michael / Salavatipour, Mohammad R. et al. | 2002
- 748
-
Design and Implementation of Efficient Data Types for Static GraphsNäher, Stefan / Zlotowski, Oliver et al. | 2002
- 66
-
An Exact Algorithm for the Uniformly-Oriented Steiner Tree ProblemNielsen, Benny K. / Winter, Pawel / Zachariasen, Martin et al. | 2002
- 67
-
A Fast, Accurate and Simple Method for Pricing European-Asian and Saving-Asian OptionsOhta, Kenichiro / Sadakane, Kunihiko / Shioura, Akiyoshi / Tokuyama, Takeshi et al. | 2002
- 68
-
Sorting 13 Elements Requires 34 ComparisonsPeczarski, Marcin et al. | 2002
- 69
-
Extending Reduction Techniques for the Steiner Tree ProblemPolzin, Tobias / Daneshmand, Siavash Vahdati et al. | 2002
- 808
-
A Comparison of Multicast Pull ModelsPruhs, Kirk / Uthaisombut, Patchrawat et al. | 2002
- 71
-
Online Scheduling for Sorting BuffersRäcke, Harald / Sohler, Christian / Westermann, Matthias et al. | 2002
- 72
-
Finding the Sink Takes Some TimeSchurr, Ingo / Szabó, Tibor et al. | 2002
- 73
-
Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network DesignSellmann, Meinolf / Kliewe, Georg / Kobe stein, Achim et al. | 2002
- 74
-
Minimizing Makespan and Preemption Costs on a System of Uniform MachinesShachnai, Hadas / Tami, Tami / Woeginger, Gerhard J. et al. | 2002
- 75
-
Minimizing the Total Completion Time On-line on a Single Machine, Using Restartsvan Stee, Rob / Outré, Han La et al. | 2002
- 76
-
High-Level Filtering for Arrangements of Conic ArcsWein, Ron et al. | 2002
- 77
-
An Approximation Scheme for Cake Division with a Linear Number of CutsWoeginger, Gerhard J. et al. | 2002
- 78
-
A Simple Linear Time Algorithm for Finding Even Triangulations of 2-Connected Bipartite Plane GraphsZhang, Huaming / He, Xin et al. | 2002