Titlebook: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques; 6th International Wo Sanjeev Arora,Klaus Jansen,Am

空氣

Handedness

https://doi.org/10.1007/978-94-009-5878-4ight of the maximum weight tree in the tree cover. Given a positive integer ., the .-tree cover problem is to compute a minimum cost tree cover which has no more than . trees. Star covers are defined analogously. Additionally, we may also be provided with a set of . vertices which are to serve as ro

橢圓

Arne Aar?s,G. Horgen,M. Hellanddes a .. minor, Klein, Plotkin and Rao [15] showed that this can be done while cutting only .(../.) fraction of the edges. This implies a bound on multicommodity max-flow min-cut ratio for such graphs. This result as well as the decomposition theorem have found numerous applications to approximation

transplantation

Arne Aar?s,G. Horgen,M. Hellandthms. The problems considered have the property that the space occupied by a collection of objects together could be significantly less than the sum of the sizes of the individual objects. In the ., there are users who request subsets of items. There are a fixed number of channels that can carry an

tenosynovitis

éric Brangier,Sonia Hammes-Adelém, similar to the .-median problem. Variants of .-center may more accurately model real-life problems than the original formulation. Asymmetry is a significant impediment to approximation in many graph problems, such as .-center, facility location, .-median and the TSP..We demonstrate an .(log..)-ap

偶然

Wei-Ying Chou,Bi-Hui Chen,Wen-Ko Chiouin minimal time. In the setting of flows over time, flow on arcs may vary over time and the transit time of an arc is the time it takes for flow to travel through this arc. In most real-world applications (such as, e.g., road traffic, communication networks, production systems, etc.), transit times

concise

Wei-Ying Chou,Bi-Hui Chen,Wen-Ko Chioul matching in a k-partite k-uniform balanced hyper-graph. We prove that k-DM cannot be efficiently approximated to within a factor of . unless . = .. This improves the previous factor of . by Trevisan [Tre01]. For low . values we prove NP-hardness factors of . and . for 4-DM, 5-DM and 6-DM respectiv

DUCE

Michelle Robertson,Emily Huang,Nancy Larsoneng, Papadimitriou and Safra [5]. Using this notion, we present the first fully polynomial-time approximation scheme for finding a market equilibrium price vector. The main tool in our algorithm is the polynomial-time algorithm of Devanur et al. [6] for a variant of the problem in which there is a c

LARK

Bernhard Zimolong,Gabriele Elkeon problem. This achieves the integrality gap of the natural LP relaxation of the problem. The algorithm is based on an improved analysis of an algorithm for the linear facility location problem, and a . approximate-reduction from this problem to the soft-capacitated facility location problem. We wi

follicular-unit