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

or

Ships in 7 to 10 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 $79.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.

More in Computer Networking & Communications

Careless People

A story of where I used to work

Paperback

RRP $24.99

$21.75

13%
OFF

The E-Myth Revisited

Why Most Small Businesses Don't Work and What to Do About It

Paperback

RRP $35.00

$28.75

18%
OFF

Unlocking Business Insights : The Basics - Aneesh Banerjee

$219.75

13%
OFF

Building Next-Gen ESG Platforms with IoT and AI for Sustainable Development Goals

Hardcover

RRP $315.00

$271.99

14%
OFF

Troubleshooting PCs For Dummies

For Dummies (Computer/Tech)

Paperback

RRP $49.95

$34.97

30%
OFF

The New Age of Sexism

How the AI Revolution is Reinventing Misogyny

Paperback

RRP $36.99

$29.75

20%
OFF

$44.75

49%
OFF

Liars and Outliers

Enabling the Trust that Society Needs to Thrive

Paperback

RRP $36.95

$29.75

19%
OFF

Cybersecurity All-in-One For Dummies

For Dummies

Paperback

RRP $82.95

$58.07

30%
OFF

Dark Wire

The Incredible True Story of the Largest Sting Operation Ever

Paperback

RRP $34.99

$27.99

20%
OFF

Making Embedded Systems

2nd Edition - Design Patterns for Great Software

Paperback

RRP $95.00

$47.75

50%
OFF

Linux All-In-One For Dummies

For Dummies (Computer/Tech)

Paperback

RRP $65.95

$46.17

30%
OFF

Keanu Reeves is Not in Love With You

The Murky World of Online Romance Fraud

Paperback

RRP $29.99

$26.75

11%
OFF

From Chaos to Clarity

How Data Visualization can Save the World

Hardcover

RRP $45.95

$35.99

22%
OFF

Grey Area

Dark Web Data Collection and the Future of OSINT

Paperback

RRP $82.95

$60.75

27%
OFF

Network Security Essentials 6ed

Applications and Standards, Global Edition

Paperback

RRP $123.85

$90.75

27%
OFF

Fundamentals of Wireless Communication

Hardcover

RRP $141.95

$109.75

23%
OFF

A First Course in Digital Communications

Hardcover

RRP $139.95

$105.75

24%
OFF

Data Science from Scratch

First Principles with Python

Paperback

RRP $125.75

$60.99

51%
OFF

Cryptography and Network Security

8th Edition - Principles and Practice, Global Edition

Paperback

RRP $149.05

$105.75

29%
OFF

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 Computer Networking & Communications

Careless People

A story of where I used to work

The E-Myth Revisited

Why Most Small Businesses Don't Work and What to Do About It

Unlocking Business Insights

The Basics

Unveiling the Art of Steganography

A Modern Approach

Building Next-Gen ESG Platforms with IoT and AI for Sustainable Development Goals

Troubleshooting PCs For Dummies

For Dummies (Computer/Tech)

The New Age of Sexism

How the AI Revolution is Reinventing Misogyny

Cyberethics

Theory and Applications of Error Correcting Codes

Essentials of Computer Networking

Learning Git

A Hands-On and Visual Guide to the Basics of Git

Liars and Outliers

Enabling the Trust that Society Needs to Thrive

Cybersecurity All-in-One For Dummies

For Dummies

Dark Wire

The Incredible True Story of the Largest Sting Operation Ever

Making Embedded Systems

2nd Edition - Design Patterns for Great Software

Linux All-In-One For Dummies

For Dummies (Computer/Tech)

Keanu Reeves is Not in Love With You

The Murky World of Online Romance Fraud

From Chaos to Clarity

How Data Visualization can Save the World

Grey Area

Dark Web Data Collection and the Future of OSINT

Network Security Essentials 6ed

Applications and Standards, Global Edition

Fundamentals of Wireless Communication

A First Course in Digital Communications

Data Science from Scratch

First Principles with Python

Cryptography and Network Security

8th Edition - Principles and Practice, Global Edition

This product is categorised by