Algorithms — ESA '97
5th Annual European Symposium Graz, Austria, September 15–17, 1997 Proceedings
Burkard, Rainer.
editor.
Woeginger, Gerhard.
editor.
SpringerLink (Online service)
text
gw
1997
monographic
eng
access
XII, 524 p. online resource.
This book constitutes the refereed proceedings of the 5th Annual International European Symposium on Algorithms, ESA'97, held in Graz, Austria, September 1997. 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.
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 finite element 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 -.
edited by Rainer Burkard, Gerhard Woeginger.
Computer science
Computer communication systems
Computers
Algorithms
Computer science
Mathematics
Computer graphics
Combinatorics
Computer Science
Theory of Computation
Algorithm Analysis and Problem Complexity
Computer Graphics
Discrete Mathematics in Computer Science
Computer Communication Networks
Combinatorics
QA75.5-76.95
004.0151
Springer eBooks
Lecture Notes in Computer Science, 1284
9783540695363
http://dx.doi.org/10.1007/3-540-63397-9
http://dx.doi.org/10.1007/3-540-63397-9
121227
20170515111448.0
978-3-540-69536-3