Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Quasi-Polynomial Time Approximation Schemes for Packing and Covering ..."

Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese (2020)

> Home

Details and statistics

DOI: 10.1007/S00453-019-00670-W

access: closed

type: Journal Article

metadata version: 2020-05-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/PilipczukLW20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/PilipczukLW20
Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese:
Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs. Algorithmica 82(6): 1703-1739 (2020)

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.