The Minimum Latency Problem Is NP-Hard for Weighted Trees. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/conf/ipco/Sitters02>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Ren%E2%88%9A%C2%A9_Sitters>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1007%2F3-540-47867-1%5F17>
foaf:homepage	<https://doi.org/10.1007/3-540-47867-1_17>
dc:identifier	DBLP conf/ipco/Sitters02 (xsd:string)
dc:identifier	DOI doi.org%2F10.1007%2F3-540-47867-1%5F17 (xsd:string)
dcterms:issued	2002 (xsd:gYear)
rdfs:label	The Minimum Latency Problem Is NP-Hard for Weighted Trees. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Ren%E2%88%9A%C2%A9_Sitters>
swrc:pages	230-239 (xsd:string)
dcterms:partOf	<https://dblp.l3s.de/d2r/resource/publications/conf/ipco/2002>
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/conf/ipco/Sitters02/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/conf/ipco/Sitters02>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/conf/ipco/ipco2002.html#Sitters02>
rdfs:seeAlso	<https://doi.org/10.1007/3-540-47867-1_17>
swrc:series	<https://dblp.l3s.de/d2r/resource/conferences/ipco>
dc:title	The Minimum Latency Problem Is NP-Hard for Weighted Trees. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:InProceedings
rdf:type	foaf:Document