Path: utzoo!attcan!uunet!zaphod.mps.ohio-state.edu!usc!rutgers!aramis.rutgers.edu!paul.rutgers.edu!yoko.rutgers.edu!venugopa From: venugopa@yoko.rutgers.edu (Sesh Venugopal) Newsgroups: comp.theory Subject: Weighted matching Message-ID: Date: 21 Oct 90 22:53:07 GMT Organization: Rutgers Univ., New Brunswick, N.J. Lines: 14 I need to know what the current lower bounds are for the weighted bipartite and non-bipartite matching problems. What are the time complexities of the best known algorithms for these? Thanks. Please send mail to venugopa@paul.rutgers.edu --Sesh -- -------------------------------------------------------------------------- Sesh Venugopal venugopa@paul.rutgers.edu Dept. of Computer Science venugopa@aramis.rutgers.edu Rutgers University New Brunswick, NJ 08903