Titlebook: Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques; 4th International Wo Michel Goemans,Klaus Jansen,Lu

SAGE

忧伤

体贴

Approximation Schemes for Ordered Vector Packing Problemsant Dilworth number, i.e. instances where the set of items can be partitioned into a constant number of totally ordered subsets. We use ideas from classical and recent approximation schemes for related problems, as well as a nontrivial procedure to round an LP solution associated with the packing of the small items.

项目

overbearing

The Maximum Acyclic Subgraph Problem and Degree-3 Graphsproximation algorithm for the maximum acyclic subgraph problem in graphs with maximum degree 3, then there is a (1/2 + δ)-approximation algorithm for general graphs for some δ > 0. The problem of finding a better-than-half approximation for general graphs is open.

裂缝

粗鄙的人

Ergonomische Arbeitsmittelgestaltung,proximation algorithm for the maximum acyclic subgraph problem in graphs with maximum degree 3, then there is a (1/2 + δ)-approximation algorithm for general graphs for some δ > 0. The problem of finding a better-than-half approximation for general graphs is open.

条街道往前推

深陷

Accidents, Errors and Interfaces,We then consider the problem of scheduling non-preemptively tasks (of non-uniform lengths) that require exclusive use of dedicated processors. The objective is to minimize the sum of completion times. We obtain the first constant factor approximations for this problem, when each task uses a constant number of processors.

贪婪性