The template topicsearch could not be loaded. HTTP Status code: 0

Extended Abstract




Extended Abstract

Extended Abstract

In recent years approximation algorithms based on primal-dual methods have been successfully applied to a broad class of discrete optimization problems. In this paper, we propose a generic primal-dual framework to design and analyze approximation algorithms for integer programming problems of the covering type that uses valid inequalities in its design. The worst-case bound of the proposed algorithm is related to a fundamental relationship (called strength) between the set of valid inequalities and the set of minimal solutions to the covering problems. In this way, we can construct an approximation algorithm simply by constructing the required valid ...
The template citationGeneratorTemplate could not be loaded. HTTP Status code: 0
Related Ads
The template BecomeFreememberTemplate could not be loaded. HTTP Status code: 0
The template reportTopicTemplate could not be loaded. HTTP Status code: 0
The template buyTopicStepTemplate could not be loaded. HTTP Status code: 0
The template footersearch could not be loaded. HTTP Status code: 0