The Euclidean degree-4 minimum spanning tree problem is NP-hard.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/compgeom/FranckeH09
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/compgeom/FranckeH09
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Andrea_Francke
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Michael_Hoffmann_0001
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F1542362.1542399
>
foaf:
homepage
<
https://doi.org/10.1145/1542362.1542399
>
dc:
identifier
DBLP conf/compgeom/FranckeH09
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F1542362.1542399
(xsd:string)
dcterms:
issued
2009
(xsd:gYear)
rdfs:
label
The Euclidean degree-4 minimum spanning tree problem is NP-hard.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Andrea_Francke
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Michael_Hoffmann_0001
>
swrc:
pages
179-188
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/compgeom/2009
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/compgeom/FranckeH09/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/compgeom/FranckeH09
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/compgeom/compgeom2009.html#FranckeH09
>
rdfs:
seeAlso
<
https://doi.org/10.1145/1542362.1542399
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/compgeom
>
dc:
subject
bounded-degree graphs, degree-constricted graphs, degree-restricted graphs, geometric graphs, geometric optimization, np-complete, reduction, spanning trees
(xsd:string)
dc:
title
The Euclidean degree-4 minimum spanning tree problem is NP-hard.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document