Approximation Algorithms for Combinatorial Optimization - Jansen Klaus
Approximation Algorithms for Combinatorial Optimization - Jansen Klaus
- International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings
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.
EAN: 9783662191989
Marka
Symbol
021HHV03527KS
Rok wydania
2014
Strony
216
Oprawa
Miekka
Format
15.6x23.4cm
Redakcja
Jansen Klaus
Język
angielski

Bez ryzyka
14 dni na łatwy zwrot

Szeroki asortyment
ponad milion pozycji

Niskie ceny i rabaty
nawet do 50% każdego dnia
Niepotwierdzona zakupem
Ocena: /5
Marka
Symbol
021HHV03527KS
Kod producenta
9783662191989
Rok wydania
2014
Strony
216
Oprawa
Miekka
Format
15.6x23.4cm
Redakcja
Jansen Klaus
Język
angielski

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.
EAN: 9783662191989
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.
EAN: 9783662191989
Niepotwierdzona zakupem
Ocena: /5
Zapytaj o produkt
Niepotwierdzona zakupem
Ocena: /5
Napisz swoją opinię