Journal of the ACM Bibliography

Dorit S. Hochbaum and J. George Shanthikumar. Convex separable optimization is not much harder than linear optimization. Journal of the ACM, 37(4):843-862, October 1990. [BibTeX entry]
Categories and Subject Descriptors: F.2.0 [Analysis of Algorithms and Problem Complexity]; G.2.2 [Discrete Mathematics]: Graph Theory -- network problems

General Terms: Algorithms, Decision, Theory

Additional Key Words and Phrases: Nonlinear optimization, proximity results, scaling algorithms

Selected papers that cite this one

Selected references


  • Journal of the ACM homepage
  • Bibliography top level
  • Journal of the ACM Author Index
  • Search the HBP database