IBM / Cambridge University Press / Ashwinkumar B.V. / Technology’s Laboratory / / /
Facility
Massachusetts Institute of Technology’s Laboratory / Columbia University / Cornell University / /
IndustryTerm
deterministic rounding algorithm / local search algorithm / nd approximate solutions / local search / heuristic solution / approximation algorithms / Electronic web edition / bank accounts / tree metric algorithm / greedy and local search algorithms / cut-based algorithm / greedy algorithm / approximate solutions / web edition / primal solution / /
Organization
Cambridge University / School of Management / National Science Foundation / Cornell / Massachusetts Institute of Technology / Cornell University / Columbia University’s Department of Industrial Engineering and Operations Research / IBM T.J. Watson and Almaden Research Centers / Cornell University’s School of Operations Research and Industrial Engineering / /
Person
Adrian Sampson / Elisa Celis / David B. Shmoys January / Anupam Gupta / Abigail / Moses Charikar / Mike Todd / Alyssa Joy Harding / Dmitriy Drusvyatskiy / Benjamin Birnbaum / Rajiv Gandhi / David P. Williamson David / Cam Thach Nguyen / Wang / Joseph Cheriyan / Mohit Singh / Lisa Fleischer / William Austin Webb / Vijay Kothari / Jessica Chang / Sanjeev Khanna / David P. Williamson / Mathias Hallman / Eliot Anshelevich / Isaac Fung / James Davis / Alex Ja / Daniel Schmand / Ann Williamson / Roman Rischke / David B. Shmoys / Matthew Andrews / Ruth / Bruno Abrahao / Nick Harvey / Katherine Lai / Jan Karel Lenstra / Lauren Cowles / Chandra Chekuri / Anke van Zuylen / Sanjeev Arora / Renato Paes Leme / Gennady Samorodnitsky / Michel Goemans / Anna Karlin / Richard Pang / Chao Ding / Nicole Immorlica / Gwen Spencer / Igor Gorodezky / Hyung-Chan An / Katherine Moore / /
Position
editor / salesman / Author / /
ProvinceOrState
Massachusetts / /
Technology
local search algorithm / LP rounding algorithm / minimum-cut-based algorithm / 2 Greedy algorithms / deterministic rounding algorithm / viral marketing / tree metric algorithm / approximation algorithms / greedy and local search algorithms / designing approximation algorithms / /
The Design of Approximation Algorithms