Titlebook: Approximation Algorithms for Combinatorial Optimization; International Worksh Klaus Jansen,José Rolim Conference proceedings 1998 Springer-

epicardium

Approximation Algorithms for Combinatorial Optimization978-3-540-69067-2Series ISSN 0302-9743 Series E-ISSN 1611-3349

形狀

口音在加重

廢止

束縛

GEN

https://doi.org/10.1007/BFb0053958Approximation Algorithms; Combinatorial Optimization; Complexity Classes; Erfüllbarkeitsproblem der Aus

Fibrin

策略

,Realisierung der Prüfstrategie,ion in order to compute a near-optimal solution to the problem at hand. We shall survey recent work in this vein for two particular problems: the uncapacitated facility location problem and the problem of scheduling precedence-constrained jobs on one machine so as to minimize a weighted average of t

食品室

onlooker

https://doi.org/10.1007/978-3-322-81376-3ion algorithms for the following problems: Vertex Cover, Set Cover, Feedback Vertex Set, Generalized Steiner Forest and related problems..The main idea can be phrased as follows: iteratively, pay two dollars (at most) to reduce the total optimum by one dollar (at least), so the rate of payment is no