Willkommen, schön sind Sie da!
Logo Ex Libris

Algorithms and Complexity

  • Kartonierter Einband
  • 324 Seiten
(0) Erste Bewertung abgeben
Bewertungen
(0)
(0)
(0)
(0)
(0)
Alle Bewertungen ansehen
The papers in this volume were presented at the Fourth Italian Conference on Algorithms and Complexity (CIAC 2000). The conference... Weiterlesen
20%
100.00 CHF 80.00
Sie sparen CHF 20.00
Exemplar wird für Sie besorgt.
Kein Rückgaberecht!
Bestellung & Lieferung in eine Filiale möglich

Beschreibung

The papers in this volume were presented at the Fourth Italian Conference on Algorithms and Complexity (CIAC 2000). The conference took place on March 1-3, 2000, in Rome (Italy), at the conference center of the University of Rome \La Sapienza". This conference was born in 1990 as a national meeting to be held every three years for Italian researchers in algorithms, data structures, complexity, and parallel and distributed computing. Due to a signi cant participation of foreign reaserchers, starting from the second conference, CIAC evolved into an international conference. In response to the call for papers for CIAC 2000, there were 41 subm- sions, from which the program committee selected 21 papers for presentation at the conference. Each paper was evaluated by at least three program committee members. In addition to the selected papers, the organizing committee invited Giorgio Ausiello, Narsingh Deo, Walter Ruzzo, and Shmuel Zaks to give plenary lectures at the conference. We wish to express our appreciation to all the authors of the submitted papers, to the program committee members and the referees, to the organizing committee, and to the plenary lecturers who accepted our invitation.

Includes supplementary material: sn.pub/extras



Autorentext
Rossella Petreschi is Professor in the Dipartimento di Informatica, Università di Roma 'La Sapienza', where she was a founding faculty member and the director from 2003-009. She cofounded the International Conference on Algorithms and Complexity (CIAC), and she coauthored many formal academic journal and conference publications. Her research interests include algorithm design and analysis, parallel and distributed computing, efficient solutions of graph problems, labelled tree encodings, and frequency assignments in wireless networks. She has also researched and published on graph drawing, interconnection topologies and experimental algorithmics. Many of her former students occupy key positions in industry and research.

Klappentext

This book constitutes the refereed proceedings of the 4th Italian Conference on Algorithms and Complexity, CIAC 2000, held in Rome, Italy, in March 2000.The 21 revised full papers presented were carefully reviewed and selected from 41 submissions; also included are four invited survey papers. Among the topics addressed are combinatorial optimization, graph algorithms, graph computations, complexity theory, diagram design, approximation, scheduling, sorting, computational geometry, searching, and pattern matching.



Inhalt
Invited Presentations.- On Salesmen, Repairmen, Spiders, and Other Traveling Agents.- Computing a Diameter-Constrained Minimum Spanning Tree in Parallel.- Algorithms for a Simple Point Placement Problem.- Duality in ATM Layout Problems.- Regular Presentations.- The Independence Number of Random Interval Graphs.- Online Strategies for Backups.- Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem.- Semantical Counting Circuits.- The Hardness of Placing Street Names in a Manhattan Type Map.- Labeling Downtown.- The Online Dial-a-Ride Problem under Reasonable Load.- The Online-TSP against Fair Adversaries.- QuickHeapsort, an Efficient Mix of Classical Sorting Algorithms.- Triangulations without Minimum-Weight Drawing.- Faster Exact Solutions for Max2Sat.- Dynamically Maintaining the Widest k-Dense Corridor.- Reconstruction of Discrete Sets from Three or More X-Rays.- Modified Binary Searching for Static Tables.- An Efficient Algorithm for the Approximate Median Selection Problem.- Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes.- Group Updates for Bed-Black Trees.- Approximating SVP ? to within Almost-Polynomial Factors Is NP-Hard.- Convergence Analysis of Simulated Annealing-Based Algorithms Solving Flow Shop Scheduling Problems.- On the Lovász Number of Certain Circulant Graphs.- Speeding Up Pattern Matching by Text Compression.

Produktinformationen

Titel: Algorithms and Complexity
Untertitel: 4th Italian Conference, CIAC 2000, Rome, Italy, March 1-3, 2000, Proceedings
Schöpfer:
Editor:
EAN: 9783540671596
ISBN: 978-3-540-67159-6
Format: Kartonierter Einband
Herausgeber: Springer, Berlin
Genre: Informatik
Anzahl Seiten: 324
Gewicht: 498g
Größe: H235mm x B235mm
Jahr: 2000
Untertitel: Englisch
Auflage: 2000. 2000

Weitere Produkte aus der Reihe "Lecture Notes in Computer Science"