Lecture Notes in Computer Science

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)
22.86 x 15.24 x 1.27

Paperback

$84.99

or 4 interest-free payments of $21.25 with

Ships in 5 to 7 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

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

Databases Data Capture & Analysis Probability & Statistics Calculus & Mathematical Analysis Numerical Analysis

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.

Lecture Notes in Computer Science

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 Numerical Analysis

Advances in Numerical Methods and Analysis

Introductory Numerical Analysis

Learning Data Science

Data Wrangling, Exploration, Visualization, and Modeling with Python

Constrained Cooperation: Event-Triggered and Intelligent Backstepping Control for Nonlinear Multiagent Systems

Balancing Performance, Communication, and Computation

ELECTRIMACS 2024

Selected Papers â" Volume 2

Numerical Methods for Modeling Metasurface with GSTC

Impact Dynamics

A Numerical Approach

Data-Driven Modeling & Scientific Computation

Methods for Complex Systems & Big Data

Monte Carlo Integration with MATLAB and Simulink

Engineering Mathematics with MATLAB Applications

Vol. 1, Fundamentals

Applied Mathematics with F#

Integral Methods in Science and Engineering

Study and Solutions of Mathematical Models

Modern Numerical Nonlinear Optimization

Springer Optimization and Its Applications

Walter Gautschi, Volume 4

Selected Works with Commentaries

Novel Deep Learning Methodologies in Industrial and Applied Mathematics

ICIAM2023 Springer Series

Quantitative Methods for Finance with Simulations II

Numerical Methods and Monte Carlo Integration

Introduction to Numerical Mathematics

Theory, Practice and Numerous Examples

Numerical Solutions to Partial Differential Equations with Finite Difference Methods

Springer Asia Pacific Mathematics Series

Optimization, Modeling, Simulation, and Analytics

COMOSA 2025

Non-Smooth and Complementarity-Based Distributed Parameter Systems

Simulation and Hierarchical Optimization, Part II

Tools for High Performance Computing 2023

Proceedings of the 14th International Workshop on Parallel Tools for High Performance Computing

Elliptic Curves and Modular Forms in Arithmetic Geometry

Celebrating Massimo Bertolini's 60th Birthday, Milano, Italy, September 12-16, 2022

Modeling with Knowledge and Data

Concepts and Applications for Engineers

Mathematical Modeling in Life Sciences

A Practical Project-Based Approach

This product is categorised by