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

Initial

Improved Testing Algorithms for Monotonicityotone function differs from . on more than an . fraction of the domain). For any . > 0, the query complexity of the test is .((./.) · log ∣Σ ∣ · log ∣Ξ∣). The previous best known bound was ...We also present an alternative test for the boolean range Ξ = {0,1} whose query complexity .(../.. ) is independent of alphabet size ∣Σ∣.

有杂色

Improved Bounds for Sampling Contingency Tablesg(.)). Our algorithm is based on a reduction to continuous sampling from a convex set. This is an approach which was taken by Dyer, Kannan and Mount in previous work. However, the algorithm we present is simpler, and has a greater range of applicability since the requirements on the row and column sums are weaker.

注意

Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Setsa set . from ..(.) if the sum of each pair of distinct elements of . lies outside .. For . ∈ ..(.) let .(.) denote the maximal cardinality of a subset of . admissible with respect to .. In particular we show .. The methodical innovation of the whole approach is the use of large Sidon sets.

tattle

Approximation of Multi-Color Discrepancy of 2. For the linear discrepancy version of the Beck-Fiala theorem the recursive approach also fails. Here we extend the method of floating colors to multi-colorings and prove multi-color versions of the the Beck-Fiala theorem and the Barany-Grunberg theorem.

小虫

Stochastic Machine Scheduling: Performance Guarantees for LP-Based Priority Policiesterministic scheduling. In the absence of release dates, our LP-based analysis also yields an additive performance guarantee for the WSEPT rule which implies both a worst-case performance ratio and a result on its asymptotic optimality.

流浪者

省略

Polydipsia

狗窝

Scheduling with Machine Coste scheduling problems with the modification that initially the algorithm possesses no machines, but that at any point additional machines may be purchased. Upper and lower bounds on the competitive ratio are shown for both problems.

floodgate