iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: http://link.springer.com/book/10.1007/3-540-61680-2
Algorithms - ESA '96: Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996. Proceedings | SpringerLink
Skip to main content
Springer Nature Link
Log in

Algorithms - ESA '96

Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996. Proceedings

  • Conference proceedings
  • © 1996

Overview

Editors:
  1. Josep Diaz
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Maria Serna
    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 1136)

Included in the following conference series:

Conference proceedings info: ESA 1996.

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

Access this book

Log in via an institution
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

About this book

This book constitutes the refereed proceedings of the 4th European Symposium on Algorithms, ESA '96, held in Barcelona, Spain, in September 1996.
The book presents 40 revised full papers selected from 124 submissions; also are included extended abstracts of two invited presentations. The papers included cover all research areas on algorithms and their analysis as it is carried out in the fields of computer science, discrete applied and algorithmic mathematics, operations research, and all other areas of algorithms-oriented research, design and analysis.

Similar content being viewed by others

Keywords

Table of contents (41 papers)

  1. Front Matter

    Download chapter PDF

  2. Analysis of Shellsort and related algorithms

    • Robert Sedgewick
    Pages 1-11

  3. Drawing with colors

    • Ashim Garg, Roberto Tamassia, Paola Vocca
    Pages 12-26

  4. Approximating the unsatisfiability threshold of random formulas (Extended Abstract)

    • Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc
    Pages 27-38

  5. Preemptive weighted completion time scheduling of parallel jobs

    • Uwe Schwiegeishohn
    Pages 39-51

  6. Approximation algorithms for dynamic storage allocation

    • Jordan Gergov
    Pages 52-61

  7. Positive linear programming, parallel approximation and PCP's

    • Luca Trevisan
    Pages 62-75

  8. Scheduling jobs with communication delays: Using infeasible solutions for approximation

    • Rolf H. Möhring, Markus W. Schäffter, Andreas S. Schulz
    Pages 76-90

  9. Randomization of search trees by subtree size

    • Salvador Roura, Conrado Martínez
    Pages 91-106

  10. Efficient dynamic method-lookup for object oriented languages

    • Paolo Ferragina, S. Muthukrishnan
    Pages 107-120

  11. Priority queues: Small, monotone and trans-dichotomous

    • Rajeev Raman
    Pages 121-137

  12. Simulated Annealing and its problems to color graphs

    • Andreas Nolte, Rainer Schrader
    Pages 138-151

  13. The capacitated K-center problem

    • Samir Khuller, Yoram J. Sussmann
    Pages 152-166

  14. A unified local ratio approximation of node-deletion problems

    • Toshihiro Fujito
    Pages 167-178

  15. Approximation algorithms for connected dominating sets

    • Sudipto Guha, Samir Khuller
    Pages 179-193

  16. Greedy algorithms for the shortest common superstring that are asymtotically optimal

    • Alan Frieze, Wojciech Szpankowski
    Pages 194-207

  17. On the depth of randomly generated circuits

    • Tatsuie Tsukiji, Fatos Xhafa
    Pages 208-220

  18. The analysis of linear probing hashing with buckets

    • Alfredo Viola, Patricio V. Poblete
    Pages 221-233

  19. Parallel algorithms for partitioning sorted sets and related problems

    • Danny Z. Chen, Wei Chen, Koichi Wada, Kimio Kawaguchi
    Pages 234-245

  20. Fast generation of random permutations via networks simulation

    • Artur Czumaj, Przemysława Kanarek, Mirosław Kutyłowski, Krzysztof Loryś
    Pages 246-260
Back to top

Other volumes

  1. Algorithms — ESA '96

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation