Matches in DBpedia 2016-04 for { <http://citation.dbpedia.org/hash/e38c65e17b86eae40bd9d046cba58e3a5a0fba9ad493158e1e19c1edd4d5e236> ?p ?o }
Showing triples 1 to 9 of
9
with 100 triples per page.
- e38c65e17b86eae40bd9d046cba58e3a5a0fba9ad493158e1e19c1edd4d5e236 date "1988".
- e38c65e17b86eae40bd9d046cba58e3a5a0fba9ad493158e1e19c1edd4d5e236 first1 "TOM".
- e38c65e17b86eae40bd9d046cba58e3a5a0fba9ad493158e1e19c1edd4d5e236 first2 "SATISH".
- e38c65e17b86eae40bd9d046cba58e3a5a0fba9ad493158e1e19c1edd4d5e236 isCitedBy Approximate_max-flow_min-cut_theorem.
- e38c65e17b86eae40bd9d046cba58e3a5a0fba9ad493158e1e19c1edd4d5e236 journal "Proc.29th IEEE Symposium on Foundations of Computer Science".
- e38c65e17b86eae40bd9d046cba58e3a5a0fba9ad493158e1e19c1edd4d5e236 last1 "LEIGHTON".
- e38c65e17b86eae40bd9d046cba58e3a5a0fba9ad493158e1e19c1edd4d5e236 last2 "RAO".
- e38c65e17b86eae40bd9d046cba58e3a5a0fba9ad493158e1e19c1edd4d5e236 pages "422–431".
- e38c65e17b86eae40bd9d046cba58e3a5a0fba9ad493158e1e19c1edd4d5e236 title "An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms".