Probabilistic analysis of optimum partitioning

DOI10.2307/3214002zbMath0611.60011OpenAlexW4213200873MaRDI QIDQ3750704

George S. Lueker, Narendra K. Karmarkar, Richard M. Karp, Andrew M. Odlyzko

Publication date: 1986

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://escholarship.org/uc/item/5gw8j5s6

zbMATH Keywords

combinatorial optimizationsecond-moment methodoptimum partition problem

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Combinatorial probability (60C05)

Related Items

A note on the average-case behavior of a simple differencing method for partitioning, The Power of Optimization Over Randomization in Designing Experiments Involving Small Samples, Easily searched encodings for number partitioning, Lattice-based algorithms for number partitioning in the hard phase, Unnamed Item, Algorithmic obstructions in the random number partitioning problem, On the height of digital trees and related problems, A physicist's approach to number partitioning, A complete anytime algorithm for number partitioning, Heuristics and exact methods for number partitioning, Randomized methods for the number partitioning problem, Gaussian discrepancy: a probabilistic relaxation of vector balancing, Phase Transition in the Number Partitioning Problem, Two-dimensional packing algorithms for layout of disconnected graphs