| Document Date: 2012-09-10 09:13:15
Open Document File Size: 167,23 KBShare Result on Facebook
City Discrete Algorithms / / / Facility The Interdisciplinary Center / / IndustryTerm α-approximate solution / fundamental algorithms / feasible fractional solution / continuous solutions / approximation algorithm / feasible solution / greedy algorithm / approximate solution / continuous greedy algorithm / deterministic algorithm / presented greedy algorithms / continuous solution / α-approximation algorithm / social networks / fractional solution / above approximation algorithm / polynomial time α-approximation algorithm / exhaustive search / approximation algorithms / / Movie Proof / / Organization Knapsack Constraints Ariel Kulik Computer Science Department / Hadas Shachnai Computer Science Department / Interdisciplinary Center / Tami Tamir School of Computer Science / Technion / / Person Ariel Kulik / / / ProvinceOrState New York / / Technology presented greedy algorithms / α-approximation algorithm / 0.325 approximation algorithm / following algorithm / polynomial time α-approximation algorithm / approximation algorithm / continuous greedy algorithm / deterministic algorithm / greedy algorithm / above approximation algorithm / approximation algorithms / following rounding algorithm / 2.4 Approximation Algorithm / / URL http /
SocialTag |
informs MATHEMATICS OF OPERATIONS RESEARCH Vol. 00, No. 0, Xxxxxx 20xx, pp. xxx–xxx ISSN 0364-765X | EISSN |xx|0000|0xxx