Publications
Search

Publications :: Search

The Euclidean degree-4 minimum spanning tree problem is NP-hard.

Show publication

On this page you see the details of the selected publication.

    Publication properties
    Title: The Euclidean degree-4 minimum spanning tree problem is NP-hard.
    Rating: (not rated yet)
    Discussion: 0 comments
    Date: 2009
    Publication type: Conference paper
    Authors:
    No. First name Last name Show
    1. Andrea Francke
    2. Michael Hoffmann
    Download (by DOI): 10.1145/1542362.1542399
    BibTeX: conf/compgeom/FranckeH09
    DBLP: db/conf/compgeom/compgeom2009.html#FranckeH09
    Bookmark:

    The following keywords have been assigned to this publication so far. If you have logged in, you can tag this publication with additional keywords.

    Keywords
    No keywords have been assigned to this publication yet.

    If you log in you can tag this publication with additional keywords

    A publication can refer to another publication (outgoing references) or it can be referred to by other publications (incoming references).

    Incoming References
    No incoming references have been assigned to this publication yet.
    Outgoing References
    No outgoing references have been assigned to this publication yet.

    If you log in you can add references to other publications

    A publication can be assigned to a conference, a journal or a school.

    Conference
    Name: Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009 2009
    DBLP: db/conf/compgeom/compgeom2009.html