An Optimal Algorithm for On-line Bipartite Matching Richard M. Karp University of California at Berkeley - M-matrix - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2004-09-11 21:06:21 Combinatorial optimization Matching Randomized algorithm Rank Matrix Hungarian algorithm Disjunct matrix Mathematics Theoretical computer science Algebra		An Optimal Algorithm for On-line Bipartite Matching Richard M. Karp University of California at Berkeley & International Computer Science Institute Umesh V. Vazirani University of California at Berkeley Add to Reading List Source URL: www.cs.berkeley.edu Download Document from Source Website File Size: 545,96 KB Share Document on Facebook

	Eﬃciently Decodable Error-Correcting List Disjunct Matrices and Applications (Extended Abstract) Hung Q. Ngo1 , Ely Porat2, and Atri Rudra1, 2 DocID: 15CcY - View Document
	This Journal Version appears in Algorithmica, Volume 67, Issue 3, pages 418–448. NovemberBlack-box Trace&Revoke Codes Hung Q. Ngo1 , Duong Hieu Phan2,3 , and David Pointcheval2 1 DocID: 14TZh - View Document
	Non-Adaptive Complex Group Testing with Multiple Positive Sets Francis Y.L. Chin, Henry C.M. Leung, S.M. Yiu Department of Computer Science, The University of Hong Kong, Pokfulam, Hong Kong Abstract DocID: 14Mmy - View Document
	Curriculum for BEng in Computer Engineering DocID: Vpcx - View Document
	Curriculum for BEng in Computer Engineering DocID: VbB7 - View Document