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

Weber-test

书目名称Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques影响因子(影响力)




书目名称Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques影响因子(影响力)学科排名




书目名称Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques网络公开度




书目名称Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques网络公开度学科排名




书目名称Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques被引频次




书目名称Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques被引频次学科排名




书目名称Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques年度引用




书目名称Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques年度引用学科排名




书目名称Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques读者反馈




书目名称Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques读者反馈学科排名

挡泥板

Conference proceedings 2003and analysis of randomized and approximation algorithms, online algorithms, complexity theory, combinatorial structures, error-correcting codes, pseudorandomness, derandomization, network algorithms, random walks, Markov chains, probabilistic proof systems, computational learning, randomness in cryptography, and various applications..

surmount

吹牛大王

Integrate

Bernhard Zimolong,Gabriele Elkeut for undirected graphs its complexity status is not known: no polynomial algorithm is known, and it is also not known to be NP-hard. For undirected graphs with the input graph . being (.-1)-connected from . to ., we give an algorithm that computes a solution of size exceeding a lower bound of the optimum by at most (.-1)/2 edges.

联想

A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problemlity location problem, using a single factor-revealing LP. This answers an open question of [16]Furthermore, this analysis, combined with a recent result of Thorup [21] shows that our algorithm can be implemented in quasi-linear time, achieving the best known approximation factor in the best possible running time.

Itinerant

袭击

Arne Aarås,G. Horgen,M. Hellandgraphs excluding any minor of size ., the multicommodity max-flow min-cut ratio is at most .(..) (for the uniform demand case). This also improves the performance guarantees of several applications of the decomposition theorem.

思想

Éric Brangier,Sonia Hammes-Adelé . variant each vertex must have . (unweighted) centers nearby: we give an .(log..)-bicriteria algorithm using 2. centers, for small ...Finally, the following three versions of the asymmetric .-center problem we show to be inapproximable: .-center, ., and ..

flamboyant