"An efficient polynomial time approximation scheme for the vertex cover ..."

Yongtang Shi, Jianhua Tu (2019)

> Home

Details and statistics

DOI: 10.7151/DMGT.2060

access: open

type: Journal Article

metadata version: 2021-10-14

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dmgt/ShiT19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dmgt/ShiT19
Yongtang Shi, Jianhua Tu:
An efficient polynomial time approximation scheme for the vertex cover P3 problem on planar graphs. Discuss. Math. Graph Theory 39(1): 55-65 (2019)

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.