Algorithm Theory -- SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings

by Arge, Lars; Freivalds, Rusins

• ISBN13: 9783540357537
• ISBN10: 354035753X
• Format: Paperback
• Copyright: 2006-07-15
• Publisher: Springer Verlag

Summary

This book constitutes the refereed proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT 2006, held in Riga, Latvia, in July 2006. The 36 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 154 submissions. The papers address all issues of theoretical algorithmics and applications in various fields including graph algorithms, computational geometry, scheduling, approximation algorithms, network algorithms, data storage and manipulation, combinatorics, sorting, searching, online algorithms, optimization, etc.

Table of Contents

Top-down analysis of path compression : deriving the inverse-Ackermann bound naturally (and easily)	p. 1
Results and problems on self-adjusting search trees and related data structures	p. 2
Classic and quantum network coding	p. 3
Multiplexing packets with arbitrary deadlines in bounded buffers	p. 5
Scheduling jobs on grid processors	p. 17
Variable sized online interval coloring with bandwidth	p. 29
A simpler linear-time recognition of circular-arc graphs	p. 41
An O(n[superscript 2.75]) algorithm for online topological ordering	p. 53
Dynamic matching markets and voting paths	p. 65
Sorting by merging or merging by sorting?	p. 77
Finding the position of the k-mismatch and approximate tandem repeats	p. 90
Unbiased matrix rounding	p. 102
Online, non-preemptive scheduling of equal-length jobs on two identical machines	p. 113
Paging with request sets	p. 124
Decentralization and mechanism design for online machine scheduling	p. 136
Exponential time algorithms for the minimum dominating set problem on some graph classes	p. 148
Exact computation of maximum induced forest	p. 160
Fast subexponential algorithm for non-local problems on graphs of bounded genus	p. 172
On the approximation hardness of some generalizations of TSP	p. 184
Reoptimization of minimum and maximum traveling salesman's tours	p. 196
The node-weighted Steiner problem in graphs of restricted node weights	p. 208
On guarding rectilinear domains	p. 220
Approximation algorithms for the minimum convex partition problem	p. 232
Approximation of octilinear Steiner trees constrained by hard and soft obstacles	p. 242
Simultaneous embedding with two bends per edge in polynomial area	p. 255
Acyclic orientation of drawings	p. 268
Improved algorithms for quantum identification of Boolean oracles	p. 280
Approximability of minimum AND-circuits	p. 292
Triangles, 4-cycles and parameterized (in-)tractability	p. 304
Better approximation schemes for disk graphs	p. 316
An approximation algorithm for the wireless gathering problem	p. 328
Minimum membership set covering and the consecutive ones property	p. 339
Approximating rational objectives is as easy as approximating linear ones	p. 351
In-place algorithms for computing (layers of) maxima	p. 363
Largest and smallest tours and convex hulls for imprecise points	p. 375
On spanners of geometric graphs	p. 388
The weighted maximum-mean subtree and other bicriterion subtree problems	p. 400
Linear-time algorithms for tree root problems	p. 411
Generalized powers of graphs and their algorithmic use	p. 423
Table of Contents provided by Blackwell. All Rights Reserved.