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 language | English (US) |
|---|---|
| Title of host publication | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms |
| Editors | Anon |
| Place of Publication | Philadelphia, PA, United States |
| Publisher | SIAM |
| Pages | 211-218 |
| Number of pages | 8 |
| State | Published - 1998 |
| Event | Proceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA Duration: Jan 25 1998 → Jan 27 1998 |
Other
| Other | Proceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms |
|---|---|
| City | San Francisco, CA, USA |
| Period | 1/25/98 → 1/27/98 |
ASJC Scopus subject areas
- Chemical Health and Safety
- Software
- Safety, Risk, Reliability and Quality
- Discrete Mathematics and Combinatorics