Algorithm Theory - SWAT'98 Book

	Recent Developments in Maximum Flow Algorithms	1
	An [epsilon] - Approximation Algorithm for Weighted Shortest Paths on Polyhedral Surfaces	11
	Facility Location with Dynamic Distance Functions	23
	An Approximation Scheme for Bin Packing with Conflicts	35
	Approximations for the General Block Distribution of a Matrix	47
	An Optimal Algorithm for Computing Visible Nearest Foreign Neighbors Among Colored Line Segments	59
	Moving an Angle Around a Region	71
	Models and Motion Planning	83
	Constrained Square-Center Problems	95
	Worst-Case Efficient External-Memory Priority Queues	107
	Simple Confluently Persistent Catenable Lists	119
	Improved Upper Bounds for Time-Space Tradeoffs for Selection with Limited Storage	131
	Probabilistic Data Structures for Priority Queues	143
	Extractors for Weak Random Sources and Their Applications	155
	Comparator Networks for Binary Heap Construction	158
	Two-Variable Linear Programming in Parallel	169
	Optimal Deterministic Protocols for Mobile Robots on a Grid	181
	Concurrent Multicast in Weighted Networks	193
	Some Recent Strong Inapproximability Results	205
	Minimal Elimination of Planar Graphs	210
	Memory Requirements for Table Computations in Partial [kapa]-tree Algorithms	222
	Formal Language Constrained Path Problems	234
	Local Search Algorithms for SAT: Worst-Case Analysis	246
	Speed Is More Powerful than Clairvoyance	255
	Randomized Online Multi-threaded Paging	264
	Determinant: Old Algorithms, New Insights	276
	Solving Fundamental Problems on Sparse-Meshes	288
	Output-Sensitive Cell Enumeration in Hyperplane Arrangements	300
	Fast and Efficient Computation of Additively Weighted Voronoi Cells for Applications in Molecular Biology	310
	On the Number of Regular Vertices of the Union of Jordan Regions	322
	Distribution-Sensitive Algorithms	335
	Author Index	347