- document
- Beshir, A.A. (author), Kuipers, F.A. (author) conference paper 2009
- document
- Beshir, A.A. (author), Kuipers, F.A. (author), Orda, Ariel (author), Van Mieghem, P.F.A. (author) conference paper 2009
- document
- Fu, B (author), Kuipers, F.A. (author), Van Mieghem, P.F.A. (author) conference paper 2008
- document
- Zhou, W (author), Janic, M (author), Kooij, Robert (author), Kuipers, F.A. (author) conference paper 2007
- document
-
Kuipers, F.A. (author)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...conference paper 2006
- document
- Kuipers, F.A. (author), Van Mieghem, P.F.A. (author) conference paper 2003