Algorithms - ESA '96

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

AvJoseph Diaz,Maria Serna

Häftad, Engelska, 1996

Del i serien Lecture Notes in Computer Science

542 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:1996-09-11
Mått:155 x 235 x 32 mm
Vikt:873 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:568
Upplaga:1996
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540616801

Utforska kategorier

Innehållsförteckning

Analysis of Shellsort and related algorithms.- Drawing with colors.- Approximating the unsatisfiability threshold of random formulas (Extended Abstract).- Preemptive weighted completion time scheduling of parallel jobs.- Approximation algorithms for dynamic storage allocation.- Positive linear programming, parallel approximation and PCP's.- Scheduling jobs with communication delays: Using infeasible solutions for approximation.- Randomization of search trees by subtree size.- Efficient dynamic method-lookup for object oriented languages.- Priority queues: Small, monotone and trans-dichotomous.- Simulated Annealing and its problems to color graphs.- The capacitated K-center problem.- A unified local ratio approximation of node-deletion problems.- Approximation algorithms for connected dominating sets.- Greedy algorithms for the shortest common superstring that are asymtotically optimal.- On the depth of randomly generated circuits.- The analysis of linear probing hashing with buckets.- Parallel algorithms for partitioning sorted sets and related problems.- Fast generation of random permutations via networks simulation.- On the Parallel Dynamic Dictionary Matching problem: New results with applications.- Parallel algorithms for series parallel graphs.- Parallel complexity of householder QR factorization.- Reporting red-blue intersections between two sets of connected line segments.- Matching convex shapes with respect to the symmetric difference.- On minimum-area hulls.- Negative-cycle detection algorithms.- A new regular grammar pattern matching algorithm.- Lempel-Ziv index for q-grams.- Computing upper and lower bounds on textile nesting problems.- On-line and off-line approximation algorithms for vector covering problems.- Competitive analysis of randomized paging algorithms.- On-line competitive algorithms for call admission in optical networks.- Race-condition detection in parallel computation with semaphores (extended abstract).- Efficient wavelength routing on directed fiber trees.- A lower bound for nearly minimal adaptive and hot potato algorithms.- The structure of circular decomposable metrics.- Faster algorithms for subgraph isomorphism of ?-connected partial ?-trees.- Planar spanners and approximate shortest path queries among obstacles in the plane.- A new approach to optimal planning of robot motion on a tree with obstacles.- Generalized streets revisited.- Computational aspects of organization theory.

Du kanske också är intresserad av

Causal Symmetric Spaces

Joachim Hilgert, Gestur Olafsson

E-bok

1996

758 kr

Algorithms and Complexity

Maria Serna, Paul G. Spirakis

E-bok

2013

710 kr

Randomization and Approximation Techniques in Computer Science

Michael G. Luby, Jose D. P. Rolim, Michael Luby, Jose Rolim, Maria Serna

Häftad, 1998

559 kr

Student's Guide to Mexican American Genealogy

Unknown

Inbunden, 1996

506 kr

Algorithmic Game Theory

Maria Serna

Häftad, 2012

500 kr

Del 8

Paradigms for Fast Parallel Approximability

Josep Díaz, Maria Serna, Paul Spirakis, Jacobo Torán

Inbunden, 1997

753 kr

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Maria Serna, Ronen Shaltiel, Klaus Jansen, José Rolim

Häftad, 2010

1 110 kr

Changing Numbers, Changing Needs

Committee on Population, Commission on Behavioral and Social Sciences and Education, Division of Behavioral and Social Sciences and Education, National Research Council, Gary D. Sandefur, Ronald R. Rindfuss, Barney Cohen

E-bok

1996

1 085 kr

Experimental Algorithms

Maria Serna, Carme Alvarez

E-bok

2006

710 kr

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Jose Rolim, Klaus Jansen, Ronen Shaltiel, Maria Serna

E-bok

2010

1 413 kr