[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/jacm/LeightonR99>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Frank_Thomson_Leighton>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Satish_Rao>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1145%2F331524.331526>
foaf:homepage <https://doi.org/10.1145/331524.331526>
dc:identifier DBLP journals/jacm/LeightonR99 (xsd:string)
dc:identifier DOI doi.org%2F10.1145%2F331524.331526 (xsd:string)
dcterms:issued 1999 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/jacm>
rdfs:label Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Frank_Thomson_Leighton>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Satish_Rao>
swrc:number 6 (xsd:string)
swrc:pages 787-832 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/jacm/LeightonR99/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/jacm/LeightonR99>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/jacm/jacm46.html#LeightonR99>
rdfs:seeAlso <https://doi.org/10.1145/331524.331526>
dc:subject VLSI layout, approximation algorithms, divide and conquer, graph bisection, graph partitioning, maximum flow, minimum cut, muticommocity flow, routing (xsd:string)
dc:title Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 46 (xsd:string)