"Purely combinatorial approximation algorithms for maximum k-vertex cover ..."

Édouard Bonnet et al. (2018)

> Home

Details and statistics

DOI: 10.1016/J.DISOPT.2017.09.001

access: closed

type: Journal Article

metadata version: 2020-02-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/disopt/BonnetEPS18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/disopt/BonnetEPS18
Édouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis:
Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs. Discret. Optim. 27: 26-56 (2018)

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.