Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/algorithmica/PilipczukLW20
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/algorithmica/PilipczukLW20
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Andreas_Wiese
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Erik_Jan_van_Leeuwen
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Michal_Pilipczuk
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2Fs00453-019-00670-w
>
foaf:
homepage
<
https://doi.org/10.1007/s00453-019-00670-w
>
dc:
identifier
DBLP journals/algorithmica/PilipczukLW20
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2Fs00453-019-00670-w
(xsd:string)
dcterms:
issued
2020
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/algorithmica
>
rdfs:
label
Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Andreas_Wiese
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Erik_Jan_van_Leeuwen
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Michal_Pilipczuk
>
swrc:
number
6
(xsd:string)
swrc:
pages
1703-1739
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/algorithmica/PilipczukLW20/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/algorithmica/PilipczukLW20
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica82.html#PilipczukLW20
>
rdfs:
seeAlso
<
https://doi.org/10.1007/s00453-019-00670-w
>
dc:
title
Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
82
(xsd:string)