[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/tamc/MorsyN07>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Ehab_Morsy>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Hiroshi_Nagamochi>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2F978-3-540-72504-6%5F31>
foaf:homepage <https://doi.org/10.1007/978-3-540-72504-6_31>
dc:identifier DBLP conf/tamc/MorsyN07 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2F978-3-540-72504-6%5F31 (xsd:string)
dcterms:issued 2007 (xsd:gYear)
rdfs:label Approximating Capacitated Tree-Routings in Networks. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Ehab_Morsy>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Hiroshi_Nagamochi>
swrc:pages 342-353 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/tamc/2007>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/tamc/MorsyN07/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/tamc/MorsyN07>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/tamc/tamc2007.html#MorsyN07>
rdfs:seeAlso <https://doi.org/10.1007/978-3-540-72504-6_31>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/tamc>
dc:subject Approximation Algorithm; Graph Algorithm; Routing Problems; Network Optimization; Tree Cover (xsd:string)
dc:title Approximating Capacitated Tree-Routings in Networks. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document