A polynomial-time approximation scheme for embedding hypergraph in a cycle.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/talg/LiDX09
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/talg/LiDX09
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Guojun_Li
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Xiaotie_Deng
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Ying_Xu_0001
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F1497290.1497296
>
foaf:
homepage
<
https://doi.org/10.1145/1497290.1497296
>
dc:
identifier
DBLP journals/talg/LiDX09
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F1497290.1497296
(xsd:string)
dcterms:
issued
2009
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/talg
>
rdfs:
label
A polynomial-time approximation scheme for embedding hypergraph in a cycle.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Guojun_Li
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Xiaotie_Deng
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Ying_Xu_0001
>
swrc:
number
2
(xsd:string)
swrc:
pages
20:1-20:12
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/talg/LiDX09/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/talg/LiDX09
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/talg/talg5.html#LiDX09
>
rdfs:
seeAlso
<
https://doi.org/10.1145/1497290.1497296
>
dc:
subject
Hypergraph embedding, NP-hard, minimum congestion, polynomial-time approximation scheme
(xsd:string)
dc:
title
A polynomial-time approximation scheme for embedding hypergraph in a cycle.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
5
(xsd:string)