Approximation, Randomization and Combinatorial Optimization

Algorithms and Techniques : 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomizatio

By: Michel Goemans (Editor), Klaus Jansen (Editor), Jose D.P. Rolim (Editor)

Write A Review

Paperback | 3 August 2001

At a Glance

Paperback
312 Pages

Dimensions(cm)
23.39 x 15.6 x 1.65

Paperback

$84.99

or 4 interest-free payments of $21.25 with

Aims to ship in 7 to 10 business days

This book constitutes the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Ranomization and Approximation Techniques in Computer Science, RANDOM 2001, held in Berkeley, California, USA in August 2001. The 26 revised full papers presented were carefully reviewed and selected from a total of 54 submissions. Among the issues addressed are design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization, de-randomization, average-case analysis, approximation classes, randomized complexity theory, scheduling, routing, coloring, partitioning, packing, covering, computational geometry, network design, and applications in various fields.

Shipping

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

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 Medicine Medicine in General Mathematics Calculus & Mathematical Analysis Computing & I.T.Computer Programming & Software Development Algorithms & Data Structures Computer Science Mathematical Theory of Computation Combinatorics & Graph Theory Business Applications

Mathematical & Statistical Software Databases Data Capture & Analysis Probability & Statistics

Invited Talks
Using Complex Semidefinite Programming for Approximating MAX E2-LIN3	p. 1
Hill-Climbing vs. Simulated Annealing for Planted Bisection Problems	p. 2
Web Search via Hub Synthesis	p. 6
Error-Correcting Codes and Pseudorandom Projections	p. 7
Order in Pseudorandomness	p. 10
Contributed Talks of APPROX Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows	p. 12
On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique	p. 24
Online Weighted Flow Time and Deadline Scheduling	p. 36
An Online Algorithm for the Postman Problem with a Small Penalty	p. 48
A Simple Dual Ascent Algorithm for the Multilevel Facility Location Problem	p. 55
Approximation Schemes for Ordered Vector Packing Problems	p. 63
Incremental Codes	p. 75
A 3/2-Approximation Algorithm for Augmenting the Edge-Connectivity of a Graph from 1 to 2 Using a Subset of a Given Edge Set	p. 90
Approximation Algorithms for Budget-Constrained Auctions	p. 102
Minimizing Average Completion of Dedicated Tasks and Interval Graphs	p. 114
A Greedy Facility Location Algorithm Analyzed Using Dual Fitting	p. 127
0.863-Approximation Algorithm for MAX DICUT	p. 138
The Maximum Acyclic Subgraph Problem and Degree-3 Graphs	p. 147
Some Approximation Results for the Maximum Agreement Forest Problem	p. 159
Contributed Talks of RANDOM
Near-Optimum Universal Graphs for Graphs with Bounded Degrees	p. 170
On a Generalized Ruin Problem	p. 181
On the b-Partite Random Asymmetric Traveling Salesman Problem and Its Assignment Relaxation	p. 192
Exact Sampling in Machine Scheduling Problems	p. 202
On Computing Ad-hoc Selective Families	p. 211
L Infinity Embeddings	p. 223
On Euclidean Embeddings and Bandwidth Minimization	p. 229
The Non-approximability of Non-Boolean Predicates	p. 241
On the Derandomization of Constant Depth Circuits	p. 249
Testing Parenthesis Languages	p. 261
Proclaiming Dictators and Juntas or Testing Boolean Formulae	p. 273
Equitable Coloring Extends Chernoff-Hoeffding Bounds	p. 285
Author Index	p. 297
Table of Contents provided by Publisher. All Rights Reserved.

Approximation, Randomization and Combinatorial Optimization

Algorithms and Techniques : 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomizatio

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Computer Science

The Shortest History of AI

The AI Con

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

Python Crash Course

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

The New Age of Sexism

How the AI Revolution is Reinventing Misogyny

Co-Intelligence

Living and Working with AI

The AI-Driven Leader

Harnessing AI to Make Faster, Smarter Decisions

Sea of Thieves

The Art of Piracy

Finite Element Simulations with ANSYS Workbench 2024

Theory, Applications, Case Studies

Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow 3e

Concepts, Tools, and Techniques to Build Intelligent Systems

Terraform - Up and Running

Writing Infrastructure as Code

The Human Test

How Predictability, Creativity, and the Quantum Mind Will Redefine Life in the Age of AI

Feature Engineering for Machine Learning

Principles and Techniques for Data Scientists

R for Data Science

Import, Tidy, Transform, Visualize, and Model Data

Effective Modern C++

42 Specific Ways to Improve Your Use of C++11 And C++14

This is Service Design Doing

Applying Service Design Thinking in the Real World

Python All-in-One For Dummies

3rd Edition

MRI in Practice

5th Edition

Windows 11 For Dummies, 2nd Edition

Windows 11 For Dummies

Making Things Happen : Theory in Practice

Mastering Project Management

User Story Mapping

Discover the Whote Story, Build the Right Product

Theory of Fun for Game Design

Architecture Patterns with Python

Enabling Test-Driven Development, Domain-Driven Design, and Event-Driven Microservices

Laws of UX

2nd Edition - Using Psychology to Design Better Products & Services

Scary Smart

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

This product is categorised by