Approximation Algorithms for Combinatorial Optimization
International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings
Buch in deiner Nähe kaufen
Beschreibung
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.
Includes supplementary material: sn.pub/extras
Autor*in
Klaus Jansen
Themen in »Approximation Algorithms for Combinatorial Optimization«
Approximation Algorithms Combinatorial Optimization Complexity Classes Erfüllbarkeitsproblem der Aussagenlogik Graph Computations Partition algorithm algorithms optimization programming sets algorithm analysis and problem complexity