Richard Cole Computer Science Department Courant Institute of Mathematical Sciences New York University Ashish Rastogi Computer Science Department Courant Institute / /
IndustryTerm
considered algorithms / linear utilities / polynomial time algorithms / exhaustive algorithm / tatonnement algorithm / work giving polynomial time algorithms / polynomial time algorithm / near-optimal solution / identical linear utilities / /
Organization
New York University / National Science Foundation / Richard Cole Computer Science Department Courant Institute / /
tatonnement algorithm / exhaustive algorithm / polynomial time algorithms / also considered algorithms / work giving polynomial time algorithms / polynomial time algorithm / /
Electronic Electronic Colloquium Colloquium on Computational on Computational