Approximation algorithms for combinatorial optimization : international workshop APPROX '98, Aalborg, Denmark, July 18-19, 1998 : proceedings
著者
書誌事項
Approximation algorithms for combinatorial optimization : international workshop APPROX '98, Aalborg, Denmark, July 18-19, 1998 : proceedings
（Lecture notes in computer science, 1444）
Springer, c1998
大学図書館所蔵 件 / 全46件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Selected papers from APPROX '98, held July 18-19, 1998, University of Aalborg, Denmark, in conjunction with ICALP '98
Includes bibliographical references and index
内容説明・目次
内容説明
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.
目次
Approximations of independent sets in graphs.- Using linear programming in the design and analysis of approximation algorithms: Two illustrative problems.- The Steiner tree problem and its generalizations.- Approximation schemes for covering and scheduling in related machines.- One for the price of two: A unified approach for approximating covering problems.- Approximation of geometric dispersion problems.- Approximating k-outconnected subgraph problems.- Lower bounds for on-line scheduling with precedence constraints on identical machines.- Instant recognition of half integrality and 2-approximations.- The t-vertex cover problem: Extending the half integrality framework with budget constraints.- A new fully polynomial approximation scheme for the knapsack problem.- On the hardness of approximating spanners.- Approximating circular arc colouring and bandwidth allocation in all-optical ring networks.- Approximating maximum independent set in k-clique-free graphs.- Approximating an interval scheduling problem.- Finding dense subgraphs with semidefinite programming.- Best possible approximation algorithm for MAX SAT with cardinality constraint.
「Nielsen BookData」 より