[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/jco/DEmidioFFLP19>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Daniele_Frigioni>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Guido_Proietti>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Luca_Forlizzi>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Mattia_D%27Emidio>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Stefano_Leucci_0001>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2Fs10878-018-00374-x>
foaf:homepage <https://doi.org/10.1007/s10878-018-00374-x>
dc:identifier DBLP journals/jco/DEmidioFFLP19 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2Fs10878-018-00374-x (xsd:string)
dcterms:issued 2019 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/jco>
rdfs:label Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Daniele_Frigioni>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Guido_Proietti>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Luca_Forlizzi>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Mattia_D%27Emidio>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Stefano_Leucci_0001>
swrc:number 1 (xsd:string)
swrc:pages 165-184 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/jco/DEmidioFFLP19/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/jco/DEmidioFFLP19>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/jco/jco38.html#DEmidioFFLP19>
rdfs:seeAlso <https://doi.org/10.1007/s10878-018-00374-x>
dc:title Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 38 (xsd:string)