Conference paper
The minimum latency problem
Avrim Blum, Prasad Chalasani, et al.
STOC 1994
Paper
Constructive bounds on ordered factorizations
Abstract
The number of ways to factor a natural number into an ordered product of integers, each factor greater than one, is called the ordered factorization of n and is denoted H(n). We show upper and lower bounds on H(n) with explicit constructions. © 2005 Society for Industrial and Applied Mathematics.
Related
Conference paper
Random MAX SAT, random MAX CUT, and their phase transitions
Don Coppersmith, David Gamarnik, et al.
SODA 1998
Don Coppersmith, S.E. June Hong, et al.
Data Mining and Knowledge Discovery
Conference paper
The diameter of a long range percolation graph
Don Coppersmith, David Gamarnik, et al.
SODA 2002