| Document Date: 2011-10-04 12:29:59
Open Document File Size: 230,50 KBShare Result on Facebook
City Haifa / / Company Bell Laboratories / Si / Set Cover / Lucent Technologies / / Country Israel / / / Event Product Recall / Product Issues / M&A / / IndustryTerm polynomial time algorithms / approximate fractional solution / feasible solution / approximation algorithm / binary search / polynomial time algorithm / valid solution / basic and integral solutions / approximate solution / i-th seller / constant ratio approximation algorithm / fractional solution / Online Algorithms / basic solution / integral solution / approximation algorithms / heuristic solutions / / Organization Technion / / Person Oded Shmueli§ Robert Sayegh / Ariel Kulik† Hadas Shachnai / Murray Hill / Ai / / Position author / / Product Relation of Deal Splitting / / ProgrammingLanguage R / / ProvinceOrState New Jersey / / Technology following algorithm / polynomial time algorithm / approximation algorithm / approximation algorithms / polynomial time algorithms / DSP / constant ratio approximation algorithm / /
SocialTag |
Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints∗ Ariel Kulik† Hadas Shachnai‡