Title :
Rounding in ϵ-approximation algorithms
Author :
Kuipers, Fernando
Author_Institution :
Fac. of Electr. Eng., Math. & Comput. Sci., Delft Univ. of Technol.
Abstract :
A common approach to deal with NP-hard problems is to deploy polynomial-time ϵ-approximation algorithms. These algorithms often resort to rounding and scaling to guarantee a solution that is within a factor (1 + isin) of the optimal solution. Usually, researchers either only round up or only down. In this paper we will evaluate the gain in accuracy when rounding up and down. The main application of this technique upon which we focus is quality of service routing, and specifically the restricted shortest path problem
Keywords :
polynomial approximation; quality of service; telecommunication network routing; NP-hard problems; isin-approximation algorithms; polynomial-time isin-approximation algorithms; quality of service routing; restricted shortest path problem; Approximation algorithms; Computer architecture; Computer science; Costs; Delay; Mathematics; Polynomials; Quality of service; Routing; Upper bound;
Conference_Titel :
Communications and Vehicular Technology, 2006 Symposium on
Conference_Location :
Liege
Print_ISBN :
0-7803-9784-3
Electronic_ISBN :
0-7803-9785-1
DOI :
10.1109/SCVT.2006.334379
