Algorithms - ESA '97, Vol. 128 Book

	Scheduling independent multiprocessor tasks	1
	On local search for weighted k-set packing	13
	On-line machine covering	23
	Area-efficient static and incremental graph drawings	37
	Denesting by bounded degree radicals	53
	A linear time algorithm for the arc disjoint Menger problem in planar directed graphs	64
	Distance approximating trees for chordal and dually chordal graphs	78
	Decomposition of integer programs and of generating sets	92
	Bounded degree spanning trees	104
	Optimal adaptive broadcasting with a bounded fraction of faulty nodes	118
	Weighted graph separators and their applications	130
	A new exact algorithm for general orthogonal d-dimensional knapsack problems	144
	Dynamic data structures for realtime management of large geometric scenes	157
	Solving rectilinear Steiner tree problems exactly in theory and practice	171
	Dynamically switching vertices in planar graphs	186
	A new family of randomized algorithms for list accessing	200
	On-line construction of two-dimensional suffix trees	217
	Scheduling multiclass queueing networks on parallel servers: approximate and heavy-traffic optimality of Klimov's priority rule	232
	Optimal reconstruction of graphs under the additive model	246
	Fixing variables in semidefinite relaxations	259
	Test sets of the knapsack problem and simultaneous diophantine approximation	271
	Three-dimensional meshes are less powerful than two-dimensional ones in oblivious routing	284
	Fault-tolerant real-time scheduling	296
	Collecting garbage pages in a distributed shared memory with reduced memory and communication overhead	308
	Quasi-fully dynamic algorithms for two-connectivity, cycle equivalence and related problems	326
	Minimum spanning trees in d dimensions	341
	Relaxed balance for search trees with local rebalancing	350
	Improved approximations for minimum cardinality quadrangulations of finite element meshes	364
	Dynamic storage allocation with known durations	378
	Coloring in sublinear time	388
	Competitive analysis of on-line stack-up algorithms	402
	Scheduling-LPs bear probabilities: randomized approximations for Min-Sum Criteria	416
	On piercing sets of axis-parallel rectangles and rings	430
	Seven problems: so different yet close	443
	Linear-time reconstruction of Delaunay triangulations with applications	459
	Approximating satisfiable satisfiability problems	472
	Algorithms for computing signs of 2 x 2 determinants: Dynamics and average case analysis	486
	Reconstructing the topology of a CAD model - A discrete approach	500
	Author Index	515