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

Instant online reading.
Don't wait for delivery!

Algorithm Theory - Swat 2006

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

By: Lars Arge (Editor), Rusins Freivalds (Editor)

Write A Review

Paperback | 27 June 2006

At a Glance

Paperback
452 Pages

Dimensions(cm)
24.13 x 15.88 x 1.91

Paperback

$84.99

or 4 interest-free payments of $21.25 with

Ships in 5 to 7 business days

This book constitutes the refereed proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT 2006, held in Riga, Latvia, in July 2006. The proceedings includes 36 revised full papers presented together with 3 invited papers, addressing 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, amd more.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $89.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

You Can Find This Book In

Non-Fiction Computing & I.T.Computer Networking & Communications Mathematics Applied Mathematics Mathematical Modelling Graphical & Digital Media Applications 3D Graphics & Modelling Databases Data Capture & Analysis Computer Hardware Network Hardware

Computer Programming & Software Development Algorithms & Data Structures Graphics Programming Computer Science Artificial Intelligence

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.

Algorithm Theory - Swat 2006

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

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Graphics Programming

Developing Graphics Frameworks with Java and OpenGL

R Graphics Cookbook

Practical Recipes for Visualizing Data

Curves and Surfaces for CAGD

A Practical Guide

Learning UML 2.0

A Pragmatic Introduction to UML

A Guide to Adobe Animate

Creating Your First Animations

The Book of WebGPU

Bridging Art, Design and Technology

My Lifetime Work

Mastering Perl/TK

Graphical User Interfaces in Perl

UML 2.0 in a Nutshell

A Desktop Quick Reference

Mastering Graphics Programming with Vulkan

Develop a modern rendering engine from first principles to state-of-the-art techniques

Art Between Matter and Code

Bridging Classical Art and Digital Frontiers

Computer Animation

Algorithms and Techniques

The History of Visual Magic in Computers

How It Led to AI

Hlsl and Pixel Shaders for XAML Developers

A Comprehensive Guide to Creating Hlsl Pixel Shaders for Wpf and Silverlight Applications

Learning Virtual Reality

Developing Immersive Experiences and Applications for Desktop, Web, and Mobile

Spatial Humanities

The Spatial Humanities

Empowering Novel Geometric Algebra for Graphics and Engineering

10th International Workshop, ENGAGE 2025, Hong Kong, China, July 14, 2025, Proceedings

Computer Graphics with OpenGL

Cuda by Example

An Introduction to General-Purpose Gpu Programming

The Designer's Guide to Product Vision

Learn to Build Your Strategic Influence to Shape the Future

Make Amazing Games

Using Fusion 2.5

Adobe InDesign Classroom in a Book (2021 release)

Classroom in a Book

WALCOM: Algorithms and Computation

20th International Conference and Workshops on Algorithms and Computation, WALCOM 2026, Perugia, Italy, March 4â"6, 2026, Proceedings

Rules of Play

Game Design Fundamentals

This product is categorised by