Approximation and Online Algorithms : Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers - Giuseppe Persiano

Instant online reading.
Don't wait for delivery!

Approximation and Online Algorithms

Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers

By: Giuseppe Persiano (Editor), Roberto Solis-Oba (Editor)

Write A Review

Paperback | 23 February 2005

At a Glance

Paperback
308 Pages

Dimensions(cm)
23.5 x 15.24 x 1.91

Paperback

$84.99

or 4 interest-free payments of $21.25 with

Ships in 5 to 7 business days

The 2nd Workshop on Approximation and Online Algorithms (WAOA 2004) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications arising from a variety of ?elds. WAOA 2004 took place in Bergen, Norway, from September 14 to September 16, 2004. The workshop was part of the ALGO 2004 event which also hosted ESA, WABI, IWPEC, and ATMOS. TopicsofinterestsforWAOA2004were:applicationstogametheory,appr- imation classes, coloring and partitioning, competitive analysis, computational ?nance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, routing, packing and covering, paradigms, randomization techniques, and scheduling problems. In response to our call we received 47 submissions. Each submission was reviewed by at least 3 referees, who judged the paper on originality, quality, and consistency with the topics of the conference. Based on the reviews, the Program Committee selected 21 papers. This volume contains the 21 selected papers and the two invited talks given by Yossi Azar and Klaus Jansen. We thank all the authors who submitted papers to the workshop and we also kindly thank the local organizers of ALGO 2004.

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.

You Can Find This Book In

Non-Fiction Mathematics Algebra Calculus & Mathematical Analysis Functional Analysis & Transforms Computing & I.T.Graphical & Digital Media Applications Computer Programming & Software Development Algorithms & Data Structures Applied Mathematics Numerical Analysis Discrete Mathematics

Graphics Programming Computer Science Mathematical Theory of Computation

Online packet switching	p. 1
Approximation algorithms for mixed fractional packing and covering problems	p. 6
Minimum sum multicoloring on the edges of planar graphs and partial k-trees	p. 9
Online bin packing with resource augmentation	p. 23
A PTAS for delay minimization in establishing wireless conference calls	p. 36
This side up!	p. 48
Approximation algorithm for directed multicuts	p. 61
Improved bounds for sum multicoloring and scheduling dependent jobs with minsum criteria	p. 68
Approximation algorithms for spreading points	p. 83
More powerful and simpler cost-sharing methods	p. 97
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints	p. 111
Priority algorithms for graph optimization problems	p. 126
Pricing network edges to cross a river	p. 140
Submodular integer cover and its application to production planning	p. 154
Stochastic online scheduling on parallel machines	p. 167
A 5/4-approximation algorithm for biconnecting a graph with a given Hamiltonian path	p. 181
Ordering-preserving transformations and greedy-like algorithms	p. 197
Off-line admission control for advance reservations in star networks	p. 211
Joint base station scheduling	p. 225
Universal bufferless routing	p. 239
Strong colorings of hypergraphs	p. 253
Deterministic monotone algorithms for scheduling on related machines	p. 267
Better bounds for minimizing SONET ADMs	p. 281
Table of Contents provided by Blackwell. All Rights Reserved.

Approximation and Online Algorithms

Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Computer Science

The Tech Coup

How to Save Democracy from Silicon Valley

Python Crash Course

3rd Edition - A Hands-On, Project-Based Introduction to Programming

Microsoft 365 Excel For Dummies

For Dummies (Computer/Tech)

The New Age of Sexism

How the AI Revolution is Reinventing Misogyny

The AI Con

How To Fight Big Tech's Hype and Create the Future We Want

Nexus

A Brief History of Information Networks from the Stone Age to AI

If Anyone Builds It, Everyone Dies

The Case Against Superintelligent AI

Microsoft 365 Excel All-in-One For Dummies

Excel for Dummies

Creative Machines

AI, Art & Us

The AI-Driven Leader

Harnessing AI to Make Faster, Smarter Decisions

Genesis

Artificial Intelligence, Hope, and the Human Spirit

Empire of AI

Inside the reckless race for total domination

Python All-in-One For Dummies

3rd Edition

Explainable Artificial Intelligence-based Industrial Internet of Things

Technologies and Applications

Unleashing User Innovation

Multidisciplinary Perspectives on End-User Development and Generative AI

Causal Inference and Machine Learning

In Economics, Social, and Health Sciences

The Shortest History of AI

Data Science and Machine Learning for Non-Programmers

Using SAS Enterprise Miner

Cognitive Cloud Computing

Building Intelligent Systems for Tomorrow

Life 3.0

Being Human in the Age of Artificial Intelligence

Autonomous Cyber Resilience

Hands-On Machine Learning with Scikit-Learn and PyTorch

Concepts, Tools, and Techniques to Build Intelligent Systems

Scary Smart

The Future of Artificial Intelligence and How You Can Save Our World

Computer Architecture

A Quantitative Approach

This product is categorised by