Inicio > > Ciencias de la computación > Approximation Algorithms for Combinatorial Optimization
Approximation Algorithms for Combinatorial Optimization

Approximation Algorithms for Combinatorial Optimization

 

66,64 €
IVA incluido
Disponible
Editorial:
Springer Nature B.V.
Año de edición:
1998
Materia
Ciencias de la computación
ISBN:
9783540647362
66,64 €
IVA incluido
Disponible

Selecciona una librería:

  • Librería Samer Atenea
  • Librería Aciertas (Toledo)
  • Kálamo Books
  • Librería Perelló (Valencia)
  • Librería Elías (Asturias)
  • Donde los libros
  • Librería Kolima (Madrid)
  • Librería Proteo (Málaga)

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.

Artículos relacionados