"Efficient algorithms for the max k-vertex cover problem."

Federico Della Croce, Vangelis Th. Paschos (2014)

> Home

Details and statistics

DOI: 10.1007/S10878-012-9575-7

access: closed

type: Journal Article

metadata version: 2017-06-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jco/CroceP14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/CroceP14
Federico Della Croce, Vangelis Th. Paschos:
Efficient algorithms for the max k-vertex cover problem. J. Comb. Optim. 28(3): 674-691 (2014)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.