``Integer-making theorems
From MaRDI portal
Publication:1158443
DOI10.1016/0166-218X(81)90022-6zbMath0473.05046WikidataQ56456690 ScholiaQ56456690MaRDI QIDQ1158443
Publication date: 1981
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items
The set splittability problem, Irregular subgraphs, Discrepancy of set-systems and matrices, Polychromatic colorings of hypergraphs with high balance, On some geometric methods in scheduling theory: A survey, Typical rounding problems, Constructive Discrepancy Minimization by Walking on the Edges, The probabilistic method yields deterministic parallel algorithms, Probabilistic methods, Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday), The smallest n-uniform hypergraph with positive discrepancy, Global wire routing in two-dimensional arrays, On the \(L_{2}\)-discrepancy, Approximation-Friendly Discrepancy Rounding, The continuous Beck-Fiala theorem is optimal, Probabilistic construction of deterministic algorithms: approximating packing integer programs, Balanced two-colorings of finite sets in the cube, A combinatorial proof of Fisher's inequality, A note on the Beck-Fiala theorem, The Phase Transition of Discrepancy in Random Hypergraphs, Improved distributed degree splitting and edge coloring, The discrepancy of random rectangular matrices, Vector balancing in Lebesgue spaces, Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius, Extremal problems in hypergraph colourings, Discrepancy theory and related algorithms, Constructive Discrepancy Minimization for Convex Sets, An Improvement of the Beck–Fiala Theorem, On the discrepancy of random matrices with many columns, Discrete ham sandwich theorems, On balanced colorings of sparse hypergraphs, Maximizing coverage while ensuring fairness: a tale of conflicting objectives, Multiterminal global routing: A deterministic approximation scheme, Balanced two-colorings of finite sets in the square. I, Coloring the projective plane, The Kadison-Singer problem in discrepancy theory., Irregularities of two-colourings of the NxN square lattice, Edge Coloring and Decompositions of Weighted Graphs, On the number of zero-patterns of a sequence of polynomials, The cycle discrepancy of three-regular graphs, Six Standard Deviations Suffice, An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound, A note on the discrepancy of matrices with bounded row and column sums, Transmitting in the \(n\)-dimensional cube, Integer programming in VLSI design, The convexification effect of Minkowski summation, Multicommodity flow in trees: packing via covering and iterated relaxation, A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension, Polychromatic colorings and cover decompositions of hypergraphs, Unnamed Item, Non-independent randomized rounding and coloring, Integral approximation sequences, Discrepancy and signed domination in graphs and hypergraphs, Semidefinite optimization in discrepancy theory, Unnamed Item, Better Bin Packing Approximations via Discrepancy Theory, On Expressing Majority as a Majority of Majorities, A Beck-Fiala-type theorem for Euclidean norms, Gaussian discrepancy: a probabilistic relaxation of vector balancing, Upper and lower bounds for matrix discrepancy, Balancing matrices with line shifts, Signed domination in regular graphs and set-systems, Unnamed Item, Algorithmic Aspects of Combinatorial Discrepancy, On sparse approximations to randomized strategies and convex combinations
Cites Work
