IZI1

Approximation Algorithms for Combinatorial Optimization - (Lecture Notes in Computer Science) by Klaus Jansen & Jose Rolim (Paperback)

No reviews
Target
USD 54.99
Updated: Oct 11, 2026

About this item

Book Synopsis This book constitutes the refereed proceedings of the International Workshop on Approximation Algorithms for Combinatorical Optimization, APPROX'98, held in conjunction with ICALP'98 in Aalborg, Denmark, in July 1998. The volume presents 14 revised full papers together with three invited papers selected from 37 submissions. The papers address the design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization techniques, average-case analysis, approximation classes, scheduling problems, routing and flow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, and various applications.

  • Features
    • This book constitutes the refereed proceedings of the International Workshop on Approximation Algorithms for Combinatorical Optimization, APPROX'98, held in conjunction with ICALP'98 in Aalborg, Denmark, in July 1998.
    • Author(s): Klaus Jansen & Jose Rolim
    • 207 Pages
    • Computers, Programming
    • Series Name: Lecture Notes in Computer Science

Specifications

Dimensions (Overall)

9.21 Inches (H) x 6.14 Inches (W) x .46 Inches (D)

Weight

.68 Pounds

Suggested Age

22 Years and Up

Number of Pages

207

Genre

Computers

Sub-Genre

Programming

Series Title

Lecture Notes in Computer Science

Publisher

Springer

Theme

Algorithms

Format

Paperback

Author

Klaus Jansen & Jose Rolim

Language

English

Product photos are for illustrative purposes only and are exemplary. The colors, inscriptions, parameters, dimensions, sizes, functions, and/or any other features of the original products may look different than in reality due to their visual characteristics, so please refer to the product features that are indicated in the product descriptions.

You may also like