New approximation techniques for some ordering problems

Satish Rao, Andrea Richa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

50 Scopus citations

Abstract

Finding a solution within logarithmic factor times W for some ordering problems is presented. A recursion is developed where at each level is identified cost which, if incurred, yields subproblems with reduced spreading metric volume. Specifically, a divide-and-conquer strategy where the cost of a solution to a problem at a recursive level is C plus the cost of a solution to the subproblems at this level, and where the spreading metric volume on the subproblems is less than the original volume by Ω(C/log n) is presented. This ensures that the resulting solution has cost O(log n) times the original spreading metric volume.

Original languageEnglish (US)
Title of host publicationProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
Editors Anon
Place of PublicationPhiladelphia, PA, United States
PublisherSIAM
Pages211-218
Number of pages8
StatePublished - 1998
Externally publishedYes
EventProceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA
Duration: Jan 25 1998Jan 27 1998

Other

OtherProceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms
CitySan Francisco, CA, USA
Period1/25/981/27/98

ASJC Scopus subject areas

  • Chemical Health and Safety
  • Software
  • Safety, Risk, Reliability and Quality
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'New approximation techniques for some ordering problems'. Together they form a unique fingerprint.

  • Cite this

    Rao, S., & Richa, A. (1998). New approximation techniques for some ordering problems. In Anon (Ed.), Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 211-218). SIAM.