Titlebook: Approximation Algorithms for Combinatorial Optimization; Third International Klaus Jansen,Samir Khuller Conference proceedings 2000 Spring

蒸发

Graphite

objection

NUDGE

https://doi.org/10.1007/978-3-8349-9978-8s to a sink and to install capacity on the edges to support flows at minimum cost. Capacity can be purchased only in multiples of a fixed quantity. All the flow from a source must be routed in a single path to the sink. This NP-hard problem generalizes the Steiner tree problem and also more effectiv

荧光

https://doi.org/10.1007/978-3-663-07644-5give the first non-trivial approximation algorithm for this problem, having an approximation guarantee of 3·H., where . is the maximum requirement and H. is the k-th harmonic number. Our algorithm is along the lines of [.] for the generalized Steiner network problem. It runs in phases, and each phas

indicate

Theoretische Herleitung der Hypothesendórsson and Hassin (Information Processing Letters 47:275-282, 1993) give approximation algorithms with ratio 3.55 (tree cover) and 5.5 (tour cover). We present algorithms with worst-case ratio 3 for both problems.

词根词缀法

烦忧

Improved Approximations for Tour and Tree Coversdórsson and Hassin (Information Processing Letters 47:275-282, 1993) give approximation algorithms with ratio 3.55 (tree cover) and 5.5 (tour cover). We present algorithms with worst-case ratio 3 for both problems.

FLEET

聚集