Format:
Online-Ressource (XII, 566 S.)
Edition:
Online-Ausg. Berlin [u.a.] Springer 2006 Springer Lecture Notes Archive
ISBN:
9783540706670
Series Statement:
Lecture notes in computer science 1136
Content:
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.
Content:
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.
Note:
Literaturangaben
Additional Edition:
ISBN 3540616802
Additional Edition:
ISBN 9783540616801
Additional Edition:
Erscheint auch als Druck-Ausgabe Algorithms - ESA '96 Berlin : Springer, 1996 ISBN 3540616802
Language:
English
Subjects:
Computer Science
Keywords:
Algorithmus
;
Konferenzschrift
DOI:
10.1007/3-540-61680-2
URL:
Volltext
(lizenzpflichtig)
URL:
Volltext
(lizenzpflichtig)
URL:
Volltext
(lizenzpflichtig)
Bookmarklink
