ISBN: 3-540-67159-5
TITLE: Algorithms and Complexity
AUTHOR: Bongiovanni, Giancarlo; Gambosi, Giorgio; Petreschi, Rosella (Eds.)
TOC:

Invited Presentations
On Salesmen, Repairmen, Spiders, and Other Traveling Agents 1
G. Ausiello, S. Leonardi, A. Marchetti-Spaccamela
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel 17
N. Deo, A. Abdalla
Algorithms for a Simple Point Placement Problem 32
J. Redstone, W.L. Ruzzo
Duality in ATM Layout Problems 44
S. Zaks
Regular Presentations
The Independence Number of Random Interval Graphs 59
W.F. de la Vega
Online Strategies for Backups 63
P. Damaschke
Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem 72
H.-J. Bckenhauer, J. Hromkovi c, R. Klasing, S. Seibert, W. Unger
Semantical Counting Circuits 87
F. Noilhan, M. Santha
The Hardness of Placing Street Names in a Manhattan Type Map 102
S. Seibert, W. Unger
Labeling Downtown 113
G. Neyer, F. Wagner
The Online Dial-a-Ride Problem under Reasonable Load 125
D. Hauptmeier, S.O. Krumke, J. Rambau
The Online-TSP against Fair Adversaries 137
M. Blom, S.O. Krumke, W. de Paepe, L. Stougie
QuickHeapsort, an Efficient Mix of Classical Sorting Algorithms 150
D. Cantone, G. Cincotti
Triangulations without Minimum-Weight Drawing 163
C.A. Wang, F.Y. Chin, B. Yang
Faster Exact Solutions for Max2Sat 174
J. Gramm, R. Niedermeier
Dynamically Maintaining the Widest k-Dense Corridor 187
S.C. Nandy, T. Harayama, T. Asano
Reconstruction of Discrete Sets from Three or More X-Rays 199
E. Barcucci, S. Brunetti, A. Del Lungo, M. Nivat
Modified Binary Searching for Static Tables 211
D. Merlini, R. Sprugnoli, M.C. Verri
An Efficient Algorithm for the Approximate Median Selection Problem 226
S. Battiato, D. Cantone, D. Catalano, G. Cincotti, M. Hofri
Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes 239
E. Covino, G. Pani, S. Caporaso
Group Updates for Red-Black Trees 253
S. Hanke, E. Soisalon-Soininen
Approximating SVP to within Almost-Polynomial Factors Is NP-Hard 263
I. Dinur
Convergence Analysis of Simulated Annealing-Based Algorithms Solving Flow Shop Scheduling Problems 277
K. Steinhfel, A. Albrecht, C.K. Wong
On the Lovsz Number of Certain Circulant Graphs 291
V.E. Brimkov, B. Codenotti, V. Crespi, M. Leoncini
Speeding Up Pattern Matching by Text Compression 306
Y. Shibata, T. Kida, S. Fukamachi, M. Takeda, A. Shinohara, T. Shinohara, S. Arikawa
Author Index 317
END
