Skip to main content
SpringerLink
Log in

Algorithms - ESA '98

6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings

  • Conference proceedings
  • © 1998

Overview

Editors:
  1. Gianfranco Bilardi

    1. Dipartimento di Elettronica e Informatica, Università di Padova, Padova, Italy
      Department of Electrical Engineering and Computer Science, The University of Illinois at Chicago, Chicago, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Giuseppe F. Italiano

    1. Dipartimento di Matematica Applicata e Informatica, Università “Cá Foscari” di Venezia, Venezia Mestre, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Andrea Pietracaprina

    1. Dipartimento di Matematica Pura e Applicata, Università di Padova, Padova, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Geppino Pucci

    1. Dipartimento di Elettronica e Informatica, Università di Padova, Padova, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1461)

Included in the following conference series:

Conference proceedings info: ESA 1998.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (42 papers)

  1. Randomized and On-Line Algorithms

    1. Maximizing Job Completions Online

      • Bala Kalyanasundaram, Kirk Pruhs
      Pages 235-246

    2. A Randomized Algorithm for Two Servers on the Line (Extended Abstract)

      • Yair Bartal, Marek Chrobak, Lawrence L. Larmore
      Pages 247-258

  2. Parallel and Distributed Algorithms I

    1. On Nonblocking Properties of the Beneš Network

      • Petr Kolman
      Pages 259-270

    2. Adaptability and the Usefulness of Hints (Extended Abstract)

      • Piotr Berman, Juan A. Garay
      Pages 271-282

    3. Fault-Tolerant Broadcasting in Radio Networks (Extended Abstract)

      • Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
      Pages 283-294

    4. New Bounds for Oblivious Mesh Routing

      • Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano
      Pages 295-306

    5. Evaluating Server-Assisted Cache Replacement in the Web

      • Edith Cohen, Balachander Krishnamurthy, Jennifer Rexford
      Pages 307-319

  3. Graph Algorithms

    1. Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights

      • D. Frigioni, A. Marchetti-Spaccamela, U. Nanni
      Pages 320-331

    2. A Functional Approach to External Graph Algorithms

      • James Abello, Adam L. Buchsbaum, Jeffery R. Westbrook
      Pages 332-343

    3. Minimal Triangulations for Graphs with “Few” Minimal Separators

      • Vincent Bouchitté, Ioan Todinca
      Pages 344-355

    4. Finding an Optimal Path without Growing the Tree

      • Danny Z. Chen, Ovidiu Daescu, Xiaobo (Sharon) Hu, Jinhui Xu
      Pages 356-367

    5. An Experimental Study of Dynamic Algorithms for Directed Graphs

      • Daniele Frigioni, Tobias Miller, Umberto Nanni, Giulio Pasqualone, Guido Schaefer, Christos Zaroliagis
      Pages 368-380

    6. Matching Medical Students to Pairs of Hospitals: A New Variation on a Well-known Theme

      • Robert W. Irving
      Pages 381-392

  4. Parallel and Distributed Algorithms II

    1. Δ-Stepping : A Parallel Single Source Shortest Path Algorithm

      • Ulrich Meyer, Peter Sanders
      Pages 393-404

    2. Improved Deterministic Parallel Padded Sorting

      • Ka Wong Chong, Edgar A. Ramos
      Pages 405-416

    3. Analyzing an Infinite Parallel Job Allocation Process

      • Micah Adler, Petra Berenbrink, Klaus Schröder
      Pages 417-428

    4. Nearest Neighbor Load Balancing on Graphs

      • Ralf Diekmann, Andreas Frommer, Burkhard Monien
      Pages 429-440

  5. Optimization

    1. 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves

      • Roberto Solis-Oba
      Pages 441-452

    2. Moving-Target TSP and Related Problems

      • C. S. Helvig, Gabriel Robins, Alex Zelikovsky
      Pages 453-464

    3. Fitting Points on the Real Line and Its Application to RH Mapping

      • Johan Håstad, Lars Ivansson, Jens Lagergren
      Pages 465-476
Back to top

Other volumes

  1. Algorithms — ESA’ 98

Keywords

Editors and Affiliations

  • Dipartimento di Elettronica e Informatica, Università di Padova, Padova, Italy

    Gianfranco Bilardi, Geppino Pucci

  • Department of Electrical Engineering and Computer Science, The University of Illinois at Chicago, Chicago, USA

    Gianfranco Bilardi

  • Dipartimento di Matematica Applicata e Informatica, Università “Cá Foscari” di Venezia, Venezia Mestre, Italy

    Giuseppe F. Italiano

  • Dipartimento di Matematica Pura e Applicata, Università di Padova, Padova, Italy

    Andrea Pietracaprina

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation