First Page | Meta Content | |
---|---|---|
Document Date: 2014-02-11 03:59:44Open Document File Size: 620,37 KBShare Result on FacebookCitySaarbrucken / New York / /CompanyACM Inc. / Kao / /CountryGermany / United States / /CurrencyUSD / / /FacilityPenn Plaza / University of Michigan / / /IndustryTermsimpler and more efficient algorithms / web.eecs.umich.edu/∼pettie/matching/ / maximum weight matching algorithms / polynomialtime cycle-canceling algorithm / basic feasible solutions / transportation costs / faster assignment algorithms / approximation algorithms / faster algorithms / optimization algorithms / feasible solution / linear time algorithm / greedy algorithm / approximate solution / assignment algorithm / basic solutions / optimum solution / /OrganizationNational Science Foundation / University of Michigan / US-Israel Binational Science Foundation / Department of Electrical Engineering and Computer Science / Max-Planck-Institut / /PersonGilbert / Rabin / Ai / SETH PETTIE / Huang / Williamson / Kavitha / Graphs Whereas / Duff / Kuhn / / /PositionGeneral / second author / metric traveling salesman / Graph algorithms General / /ProductGalil / /ProvinceOrStateMichigan / New York / /PublishedMediumJournal of the ACM / /Technologyassignment algorithm / RAM / faster assignment algorithms / time algorithm / MWM algorithm / polynomialtime cycle-canceling algorithm / maximum weight matching algorithms / 7 algorithms / Matching algorithms / Graph algorithms / scaling algorithm / optimization algorithms / Existing algorithms / greedy algorithm / approximation algorithms / linear time algorithm / Approximate MWM algorithms / MWM algorithms / bipartite MWPM algorithm / /URLhttp /SocialTag |