Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Efficient Algorithms for the max k -vertex cover Problem."

Federico Della Croce, Vangelis Th. Paschos (2012)

> Home

Details and statistics

DOI: 10.1007/978-3-642-33475-7_21

access: open

type: Conference or Workshop Paper

metadata version: 2018-06-26

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/ifipTCS/CroceP12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ifipTCS/CroceP12
Federico Della Croce, Vangelis Th. Paschos:
Efficient Algorithms for the max k -vertex cover Problem. IFIP TCS 2012: 295-309

a service of

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.