Print Email Facebook Twitter Rounding in e-approximation algorithms Title Rounding in e-approximation algorithms Author Kuipers, F.A. (TU Delft Network Architectures and Services) Date 2006 Abstract A common approach to deal with NP-hard problems is to deploy polymonial-time e-approximation algorithms often resort to rounding and scaling to guarantee a solution that is within a factor ( 1+ypsilon) of the optimal solution. Usually, researchers either only round up or only down. In this paper we will evaluate the gian in accuracy when rounding up and down. The main application of this technique upon which we focus is Quality Service routing and specifically the Restricted Shortest Path Problem. Subject conference contrib. refereedConf.proc. > 3 pag To reference this document use: http://resolver.tudelft.nl/uuid:193b8758-0c98-4092-81d0-63f1a80bd0ed DOI https://doi.org/10.1109/SCVT.2006.334379 Publisher IEEE Society, Liege ISBN 0780397851 Source Proceedings: IEEE SCVT 2006 Event IEEE SCVT 2006, 2006-11-23 → , Liege, Belgium Part of collection Institutional Repository Document type conference paper Rights © 2006 F.A. Kuipers Files PDF SCVT2006.pdf 354.99 KB Close viewer /islandora/object/uuid:193b8758-0c98-4092-81d0-63f1a80bd0ed/datastream/OBJ/view