Algorithms for the optimum communication spanning tree problem. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/journals/anor/Sharma06>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Prabha_Sharma>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1007%2Fs10479-006-7382-1>
foaf:homepage	<https://doi.org/10.1007/s10479-006-7382-1>
dc:identifier	DBLP journals/anor/Sharma06 (xsd:string)
dc:identifier	DOI doi.org%2F10.1007%2Fs10479-006-7382-1 (xsd:string)
dcterms:issued	2006 (xsd:gYear)
swrc:journal	<https://dblp.l3s.de/d2r/resource/journals/anor>
rdfs:label	Algorithms for the optimum communication spanning tree problem. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Prabha_Sharma>
swrc:number	1 (xsd:string)
swrc:pages	203-209 (xsd:string)
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/journals/anor/Sharma06/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/journals/anor/Sharma06>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/journals/anor/anor143.html#Sharma06>
rdfs:seeAlso	<https://doi.org/10.1007/s10479-006-7382-1>
dc:subject	Cost of communication; Cut-tree; Star-tree; Adjacent spanning tree; Adjacent basic feasible solution (xsd:string)
dc:title	Algorithms for the optimum communication spanning tree problem. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:Article
rdf:type	foaf:Document
swrc:volume	143 (xsd:string)