54 search results - page 10 / 11 » Primal-Dual RNC Approximation Algorithms for Set Cover and C... |
ICCAD
2005
IEEE
14 years 2 months ago
2005
IEEE
— In this paper we propose an exact algorithm that maximizes the sharing of partial terms in Multiple Constant Multiplication (MCM) operations. We model this problem as a Boolean...
COCOON
2008
Springer
13 years 7 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
APLAS
2009
ACM
13 years 12 months ago
2009
ACM
We present a simple algorithmic extension of the classical call-strings approach to mitigate substantial performance degradation caused by spurious interprocedural cycles. Spuriou...
ICST
2010
IEEE
13 years 3 months ago
2010
IEEE
—Recent advances in automated functional testing of Graphical User Interfaces (GUIs) rely on deriving graph models that approximate all possible sequences of events that may be e...
DCOSS
2009
Springer
13 years 12 months ago
2009
Springer
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...