Buch, Englisch, Band 1284, 524 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1640 g
5th Annual European Symposium, Graz, Austria, September 15-17, 1997. Proceedings
Buch, Englisch, Band 1284, 524 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1640 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-540-63397-6
Verlag: Springer Berlin Heidelberg
The 38 revised full papers presented were selected from 112 submitted papers. The papers address a broad spectrum of theoretical and applicational aspects in algorithms theory and design. Among the topics covered are approximation algorithms, graph and network algorithms, combinatorial optimization, computational biology, computational mathematics, data compression, distributed computing, evolutionary algorithms, neural computing, online algorithms, parallel computing, pattern matching, and others.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Technische Informatik Netzwerk-Hardware
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Grafikprogrammierung
- Mathematik | Informatik EDV | Informatik Technische Informatik Externe Speicher & Peripheriegeräte
- Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
- Mathematik | Informatik Mathematik Algebra Elementare Algebra
Weitere Infos & Material
Scheduling independent multiprocessor tasks.- On local search for weighted ?-set packing.- On-line machine covering.- Area-efficient static and incremental graph drawings.- Denesting by bounded degree radicals.- a linear time algorithm for the arc disjoint Menger problem in planar directed graphs.- Distance approximating trees for chordal and dually chordal graphs.- Decomposition of integer programs and of generating sets.- Bounded degree spanning trees.- Optimal adaptive broadcasting with a bounded fraction of faulty nodes.- Weighted graph separators and their applications.- A new exact algorithm for general orthogonal d-dimensional knapsack problems.- Dynamic data structures for realtime management of large geometric scenes.- Solving rectilinear Steiner tree problems exactly in theory and practice.- Dynamically switching vertices in planar graphs.- A new family of randomized algorithms for list accessing.- On-line construction of two-dimensional suffix trees.- Scheduling multiclass queueing networks on parallel servers: Approximate and heavy-traffic optimality of Klimov's priority rule.- Optimal reconstruction of graphs under the additive model.- Fixing variables in semidefinite relaxations.- Test sets of the knapsack problem and simultaneous diophantine approximation.- Three-dimensional meshes are less powerful than two-dimensional ones in oblivious routing.- Fault-tolerant real-time scheduling.- Collecting garbage pages in a distributed shared memory with reduced memory and communication overhead.- Quasi-fully dynamic algorithms for two-connectivity, cycle equivalence and related problems.- Minimum spanning trees in d dimensions.- Relaxed balance for search trees with local rebalancing.- Improved approximations for minimum cardinality quadrangulations of finiteelement meshes.- Dynamic storage allocation with known durations.- Coloring in sublinear time.- Competitive analysis of on-line stack-up algorithms.- Scheduling-LPs bear probabilities randomized approximations for min-sum criteria.- On piercing sets of axis-parallel rectangles and rings.- Seven problems: So different yet close.- Linear-time reconstruction of Delaunay triangulations with applications.- Approximating satisfiable satisfiability problems.- Algorithms for computing signs of 2 x 2 determinants: Dynamics and average-case analysis.- Reconstructing the topology of a CAD model - A discrete approach -.
