Berger, André and Bonifaci, Vincenzo and Grandoni, Fabrizio and Schäfer, Guido (2011) Budgeted matching and budgeted matroid intersection via the gasoline puzzle. Mathematical Programming, 128 (1-2). pp. 355-372. ISSN 1436-4646
Full text not available from this repository.Abstract
Many polynomial-time solvable combinatorial optimization problems become NP-hard if an additional complicating constraint is added to restrict the set of feasible solutions. In this paper, we consider two such problems, namely maximum-weight matching and maximum-weight matroid intersection with one additional budget constraint. We present the first polynomial-time approximation schemes for these problems. Similarly to other approaches for related problems, our schemes compute two solutions to the Lagrangian relaxation of the problem and patch them together to obtain a near-optimal solution. However, due to the richer combinatorial structure of the problems considered here, standard patching techniques do not apply. To circumvent this problem, we crucially exploit the adjacency relations on the solution polytope and, surprisingly, the solution to an old combinatorial puzzle.
| Item Type: | Scientific journal article, Newspaper article or Magazine article |
|---|---|
| Uncontrolled Keywords: | Matching; Matroid intersection; Budgeted optimization; Lagrangian relaxation |
| Subjects: | Computer sciences |
| Department/unit: | Dipartimento tecnologie innovative > Istituto Dalle Molle di studi sull’intelligenza artificiale USI-SUPSI |
| Depositing User: | Fabrizio Grandoni |
| Date Deposited: | 14 Mar 2014 08:37 |
| Last Modified: | 23 May 2016 14:29 |
| URI: | http://repository.supsi.ch/id/eprint/4484 |
Actions (login required)
 |
View Item |