Back to Results
First PageMeta Content
Combinatorial optimization / NP-complete problems / Matching / Cut / Shortest path problem / Time complexity / Maximum cut / Travelling salesman problem / Hungarian algorithm / Theoretical computer science / Graph theory / Mathematics


Document Date: 2014-02-11 03:59:44

Open Document

File Size: 620,37 KB

Share Result on Facebook

City

Saarbrucken / New York / /

Company

ACM Inc. / Kao / /

Country

Germany / United States / /

Currency

USD / /

/

Facility

Penn Plaza / University of Michigan / /

/

IndustryTerm

simpler 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 / /

Organization

National Science Foundation / University of Michigan / US-Israel Binational Science Foundation / Department of Electrical Engineering and Computer Science / Max-Planck-Institut / /

Person

Gilbert / Rabin / Ai / SETH PETTIE / Huang / Williamson / Kavitha / Graphs Whereas / Duff / Kuhn / /

/

Position

General / second author / metric traveling salesman / Graph algorithms General / /

Product

Galil / /

ProvinceOrState

Michigan / New York / /

PublishedMedium

Journal of the ACM / /

Technology

assignment 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 / /

URL

http /

SocialTag