Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Marked Items 
Alerts
Order History
Saved Items
All
Favorites
    
Book Printable view
Algorithm Engineering and Experimentation

Algorithm Engineering and Experimentation

International Workshop ALENEX’99 Baltimore, MD, USA, January 15–16, 1999 Selected Papers
Book SeriesLecture Notes in Computer Science
PublisherSpringer Berlin / Heidelberg
ISSN0302-9743 (Print) 1611-3349 (Online)
VolumeVolume 1619/1999
DOI10.1007/3-540-48518-X
Copyright1999
ISBN978-3-540-66227-3
Subject CollectionComputer Science
SpringerLink DateThursday, July 31, 2003
Add to marked items
Editorial View Condensed List View Expanded List View 
Save this listEmail this listDownload this list
20 Chapters
Front Matter

Front MatterPDF (658.0 KB)

  
Chapter
Efficient Implementation of the WARM-UP Algorithm for the Construction of Length-Restricted Prefix Codes
Ruy Luiz Milidiú, Artur Alves Pessoa and Eduardo Sany Laber
DOI: 10.1007/3-540-48518-X_1
Full TextPDF (938.8 KB)
 663
Chapter
Implementing Weighted b-Matching Algorithms: Insights from a Computational Study
Matthias Müller-Hannemann and Alexander Schwartz
DOI: 10.1007/3-540-48518-X_2
Full TextPDF (1.1 MB)
 69
Chapter
Designing Practical Efficient Algorithms for Symmetric Multiprocessors
(Extended Abstract)
David R. Helman and Joseph JáJá
DOI: 10.1007/3-540-48518-X_3
Full TextPDF (568.9 KB)
 663
Chapter
Circular Drawings of Biconnected Graphs
Janet M. Six and Ioannis G. Tollis
DOI: 10.1007/3-540-48518-X_4
Full TextPDF (700.2 KB)
 662
Chapter
Heuristics and Experimental Design for Bigraph Crossing Number Minimization
Matthias Stallmann, Franc Brglez and Debabrata Ghosh
DOI: 10.1007/3-540-48518-X_5
Full TextPDF (1.1 MB)
 69
Chapter
Binary Space Parititions in Plücker Space
David M. Mount and Fan-Tao Pu
DOI: 10.1007/3-540-48518-X_6
Full TextPDF (897.2 KB)
 663
Chapter
Practical Point-in-Polygon Tests Using CSG Representations of Polygons
Robert J. Walker and Jack Snoeyink
DOI: 10.1007/3-540-48518-X_7
Full TextPDF (924.0 KB)
 662
Chapter
Accessing the Internal Organization of Data Structures in the JDSL Library
Michael T. Goodrich, Mark Handy, Benoît Hudson and Roberto Tamassia
DOI: 10.1007/3-540-48518-X_8
Full TextPDF (1.1 MB)
 129-144
Chapter
Object-Oriented Design of Graph Oriented Data Structures
(Extended Abstract)
Maurizio Pizzonia and Giuseppe Di Battista
DOI: 10.1007/3-540-48518-X_9
Full TextPDF (366.7 KB)
 145-160
Chapter
A Case Study on the Cost of Geometric Computing
Stefan Schirra
DOI: 10.1007/3-540-48518-X_10
Full TextPDF (584.5 KB)
 161-181
Chapter
Design and Implementation of the Fiduccia-Mattheyses Heuristic for VLSI Netlist Partitioning
Andrew E. Caldwell, Andrew B. Kahng and Igor L. Markov
DOI: 10.1007/3-540-48518-X_11
Full TextPDF (946.4 KB)
 182-198
Chapter
Algorithms for Restoration Planning in a Telecommunications Network
S. Cwilich, M. Deng, D. F. Lynch, S. J. Phillipsy and J. R. Westbrooky
DOI: 10.1007/3-540-48518-X_12
Full TextPDF (1.1 MB)
 199-214
Chapter
Computing the n × m Shortest Paths Efficiently
Tetsuo Shibuya
DOI: 10.1007/3-540-48518-X_13
Full TextPDF (3.3 MB)
 215-229
Chapter
Image Watermarking for Copyright Protection
Gregory L. Heileman, Carlos E. Pizano and Chaouki T. Abdallah
DOI: 10.1007/3-540-48518-X_14
Full TextPDF (742.2 KB)
 230-249
Chapter
A Self Organizing Bin Packing Heuristic
Janos Csirik, David S. Johnson, Claire Kenyon, Peter W. Shor and Richard R. Weber
DOI: 10.1007/3-540-48518-X_15
Full TextPDF (660.2 KB)
 250-269
Chapter
Finding the Right Cutting Planes for the TSP
Matthew S. Levine
DOI: 10.1007/3-540-48518-X_16
Full TextPDF (419.6 KB)
 270-285
Chapter
Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm
Martin Zachariasen and Pawel Winter
DOI: 10.1007/3-540-48518-X_17
Full TextPDF (632.1 KB)
 286-299
Chapter
Adaptive Algorithms for Cache-efficient Trie Search
Anurag Acharya, Huican Zhu and Kai Shen
DOI: 10.1007/3-540-48518-X_18
Full TextPDF (970.1 KB)
 300-315
Chapter
Fast Priority Queues for Cached Memory
Peter Sanders
DOI: 10.1007/3-540-48518-X_19
Full TextPDF (725.4 KB)
 316-321
Chapter
Efficient Bulk Operations on Dynamic R-trees
(Extended Abstract)
Lars Arge, Klaus H. Hinrichs, Jan Vahrenhold and Jeffrey S. Vitter
DOI: 10.1007/3-540-48518-X_20
Full TextPDF (407.0 KB)
 322-341
Back Matter

Back MatterPDF (29.2 KB)

  
20 Chapters
more options
Find


Starts With
20 Results
ABCDEFGHIJKLMNOPQRSTUVWXYZspace
0123456789ÜÖËÄßÀÁÂÃÇÈÉÊÌÍÎÑÒÓÔÕÙÚÛmore
Frequently asked questions | General information on journals and books | Send us your feedback | Impressum | Contact
© Springer. Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
Remote Address: 38.107.191.105 • Server: mpweb08
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)