556 search results - page 13 / 112 » A Comparative Study of Some Generalized Rough Approximations |
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is m...
MP
2002
14 years 11 months ago
2002
The efficient solution of large-scale linear and nonlinear optimization problems may require exploiting any special structure in them in an efficient manner. We describe and analy...
110
click to vote
CSR
2009
Springer
15 years 23 days ago
2009
Springer
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
101
click to vote
CEC
2008
IEEE
15 years 6 months ago
2008
IEEE
— Many deterministic algorithms in the context of constrained optimization require the first-order derivatives, or the gradient vectors, of the objective and constraint function...
128
click to vote
MFCS
2005
Springer
15 years 5 months ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...