A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/ipco/Cohen-AddadMV22
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/ipco/Cohen-AddadMV22
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Tobias_M%E2%88%9A%E2%88%82mke
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Victor_Verdugo
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Vincent_Cohen-Addad
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F978-3-031-06901-7%5F9
>
foaf:
homepage
<
https://doi.org/10.1007/978-3-031-06901-7_9
>
dc:
identifier
DBLP conf/ipco/Cohen-AddadMV22
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F978-3-031-06901-7%5F9
(xsd:string)
dcterms:
issued
2022
(xsd:gYear)
rdfs:
label
A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Tobias_M%E2%88%9A%E2%88%82mke
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Victor_Verdugo
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Vincent_Cohen-Addad
>
swrc:
pages
112-125
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/ipco/2022
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/ipco/Cohen-AddadMV22/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/ipco/Cohen-AddadMV22
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/ipco/ipco2022.html#Cohen-AddadMV22
>
rdfs:
seeAlso
<
https://doi.org/10.1007/978-3-031-06901-7_9
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/ipco
>
dc:
title
A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document