Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks

Abstract

Article Free Access Share on Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks Authors: Baruch Awerbuch Johns Hopkins University, Baltimore, MD and MIT Laboratory for Computer Science, Cambridge, MA Johns Hopkins University, Baltimore, MD and MIT Laboratory for Computer Science, Cambridge, MAView Profile , Tom Leighton Department of Mathematics and Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA Department of Mathematics and Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MAView Profile Authors Info & Claims STOC '94: Proceedings of the twenty-sixth annual ACM symposium on Theory of ComputingMay 1994 Pages 487–496https://doi.org/10.1145/195058.195238Published:23 May 1994Publication History 112citation1,441DownloadsMetricsTotal Citations112Total Downloads1,441Last 12 Months60Last 6 weeks4 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF