[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/talg/JothiR05>
dc:creator <http://dblp.l3s.de/d2r/resource/authors/Balaji_Raghavachari>
dc:creator <http://dblp.l3s.de/d2r/resource/authors/Raja_Jothi>
foaf:homepage <http://doi.acm.org/10.1145/1103963.1103967>
foaf:homepage <http://dx.doi.org/10.1145%2F1103963.1103967>
dc:identifier DBLP journals/talg/JothiR05 (xsd:string)
dc:identifier DOI 10.1145%2F1103963.1103967 (xsd:string)
dcterms:issued 2005 (xsd:gYear)
swrc:journal <http://dblp.l3s.de/d2r/resource/journals/talg>
rdfs:label Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design. (xsd:string)
foaf:maker <http://dblp.l3s.de/d2r/resource/authors/Balaji_Raghavachari>
foaf:maker <http://dblp.l3s.de/d2r/resource/authors/Raja_Jothi>
swrc:number 2 (xsd:string)
swrc:pages 265-282 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/talg/JothiR05/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/talg/JothiR05>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/talg/talg1.html#JothiR05>
rdfs:seeAlso <http://doi.acm.org/10.1145/1103963.1103967>
dc:subject Spanning trees, approximation algorithms, minimum spanning trees, network design (xsd:string)
dc:title Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 1 (xsd:string)