Titlebook: Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques; Third International Dorit S. Hochbaum,Klaus Janse

GALL

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




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




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




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




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




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




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




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




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




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

MARS

Functional

Completeness and Robustness Properties of Min-Wise Independent Permutationse intersection of sets based on testing equality of samples yields an equivalent min-wise independent family. Thus, in a certain sense, min-wise independent families are “complete” for this type of estimation..We also discuss the notion of robustness, a concept extending min-wise independence to all

马赛克

Low Discrepancy Sets Yield Approximate Min-Wise Independent Permutation Familiesultiset . of permutations of {0,1, ... , .–1} is such a family if for all . ⊆ {0,1, ..., .–1} and any . ∈ ., a permutation . chosen uniformly at random form . statisfies....We show connections of such families with ., and give explicit constructions of such families . of size . for . = 1 / .., impro

indoctrinate

Independent Sets in Hypergraphs with Applications to Routing Via Fixed Pathsnce ratio of deterministic vs. randomized and non-preemptive vs. preemptive algorithms. Applying these results we prove bounds for the performance of online algorithms for routing problems via fixed paths over networks.

树木心

inflate

围巾

A Polynomial Time Approximation Scheme for the Multiple Knapsack Problemlected such that the items in this subset can be packed into . knapsacks of equal capacities and such that the total profit of all items in the knapsacks is maximized. For . (MKP) reduces to the classical 0-1 single knapsack problem. It is known that (MKP) admits no fully polynomial-time approximati

让步

一大群