| Document Date: 2012-10-26 12:29:22
Open Document File Size: 455,38 KBShare Result on Facebook
City Haifa / Yorktown / / Company IBM / Problem / / Country Israel / / Currency pence / / Facility Watson Research Center / / IndustryTerm faster matching algorithms / planar matching algorithm / approximation algorithm / linear time algorithm / binary search / cover algorithm / approximate nearest neighbor search / known√algorithm / much faster approximation algorithms / factor approximation algorithm / final algorithm / k-supplier solutions / faster approximation algorithms / polynomial time using algorithms / pre-processing time / k-supplier solution / time approximation algorithm / / Organization Israel Science Foundation / Computer Science Department / Technion / / ProgrammingLanguage NIL / / ProvinceOrState New York / / Technology 2.3 Algorithm / planar matching algorithm / known matching algorithm / polynomial time using algorithms / cover algorithm / matching algorithm / much faster approximation algorithms / 2.965-Approximation Algorithm / approximation algorithm / 2-approximation algorithm / 2.73 approximation algorithm / time algorithm / 3-approximation algorithm / linear time algorithm / final algorithm / nearly linear time algorithm / factor approximation algorithm / 2.2 Algorithm / 2.1 Algorithm / faster matching algorithms / time using ANN algorithms / time approximation algorithm / /
SocialTag |
The Euclidean k-Supplier Problem Viswanath Nagarajan1 , Baruch Schieber1 , and Hadas Shachnai2? 1 IBM T.J. Watson Research Center, Yorktown Heights, NYComputer Science Department, Technion, Haifa 32000, Israel