Abstract
A study is carried out to devise purely combinatorial algorithms that match improved running times. Algorithms with small additive error in the length of the paths obtained are presented. The algorithms are easy to implement, have the desired property of being combinatorial in nature, and the hidden constants in the running time bound are fairly small.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1167-1181 |
| Number of pages | 15 |
| Journal | SIAM Journal on Computing |
| Volume | 28 |
| Issue number | 4 |
| DOIs | |
| State | Published - 1999 |
| Externally published | Yes |
ASJC Scopus subject areas
- General Computer Science
- General Mathematics