An optimal algorithm for on-line bipartite matching

Abstract

Article Free Access Share on An optimal algorithm for on-line bipartite matching Authors: R. M. Karp University of California at Berkeley & International Computer Science Institute University of California at Berkeley & International Computer Science InstituteView Profile , U. V. Vazirani Cornell University Cornell UniversityView Profile , V. V. Vazirani View Profile Authors Info & Claims STOC '90: Proceedings of the twenty-second annual ACM symposium on Theory of ComputingApril 1990Pages 352–358https://doi.org/10.1145/100216.100262Published:01 April 1990Publication History 439citation3,555DownloadsMetricsTotal Citations439Total Downloads3,555Last 12 Months519Last 6 weeks66 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