Più di un milione di libri, a un clic di distanza!
Bookbot

Approximation algorithms for combinatorial optimization

Parametri

  • 271pagine
  • 10 ore di lettura

Maggiori informazioni sul libro

This book constitutes the refereed proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2002, held in Rome, Italy in September 2002. The 20 revised full papers presented were carefully reviewed and selected from 54 submissions. Among the topics addressed are design and analysis of approximation algorithms, inapproximability results, online 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 applications to game theory and other fields.

Pubblicazione

Acquisto del libro

Approximation algorithms for combinatorial optimization, Klaus Jansen

Lingua
Pubblicato
2002
product-detail.submit-box.info.binding
(In brossura)
Ti avviseremo via email non appena lo rintracceremo.

Metodi di pagamento