Sciweavers

MFCS
2005
Springer
14 years 2 months ago
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing
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...
Piotr Krysta
ICSE
2005
IEEE-ACM
14 years 9 months ago
A framework of greedy methods for constructing interaction test suites
Greedy algorithms for the construction of software interaction test suites are studied. A framework is developed to evaluate a large class of greedy methods that build suites one ...
Charles J. Colbourn, Myra B. Cohen, Renée C...