Combination can be hard: Approximability of the unique coverage problem

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 162-171

  Demaine, Erik D ^a   Feige, Uriel ^b,c   Hajiaghayi, Mohammad Taghi ^a   Salavatipour, Mohammad R ^d  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b MICROSOFT RESEARCH   (United States)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^d UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL ECONOMICS; COVERAGE PROBLEMS; INAPPROXIMABILITY;

ALGORITHMS; APPROXIMATION THEORY; ECONOMICS; OPTIMIZATION; RADIO BROADCASTING; RANDOM PROCESSES; SET THEORY;

PROBLEM SOLVING;

EID: 33244477826     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109577     Document Type: Conference Paper

References (43)

1. G. AGGARWAL, T. FEDER, R. MOTWANI, AND A. ZHU, Algorithms for multi-product pricing, in Proc. 31st International Colloq. Automata, Languages and Programming, vol. 3142 of Lecture Notes in Computer Science, 2004, pp. 72-83.
2. P. ALIMONTI AND V. KANN, Hardness of approximating problems on cubic graphs, in Proc. 3rd Italian Conference on Algorithms and Complexity, vol. 1203 of Lecture Notes in Computer Science, 1997, pp. 288-298.
3. N. ALON, A. BAR-NOY, N. LINIAL, AND D. PELEG, A lower bound for radio broadcast. Journal of Computer and System Sciences, 43 (1991), pp. 290-298.
4. C. AMBÜHL, A. E. F. CLEMENTI, M. D. IANNI, N. LEVTOY, A. MONTI, D. PELEG, G. ROSSI, AND R. SILVESTRI, Efficient algorithms for low-energy bounded-hop bivadcast in ad-hoc wireless networks, in Proc. 21st Annual Sympos. Theoretical Aspects of Computer Science, vol. 2996 of Lecture Notes in Computer Science, February 2004, pp. 418-427.
5. M. ANDREWS AND L. ZHANG, Hardness of the undirected edge-disjoint paths problem, in Proc. 37th Annual ACM Sympos. Theory of Computing, 2005, pp. 276-283.
6. A. ARCHER, C. PAPADIMITRIOU, K. TALWAR, AND É. TARDOS, An approximate truthful mechanism for combinatorial auctions with single parameter agents, in Proc. 14th Annual ACM-SIAM Sympos. Discrete Algorithms, 2003, pp. 205-214.
7. V. BAHL, M. HAJIAGHAYI, K. JAIN, V. S. MIRROKNI, L. QUI, AND A. SABERI, Cell breathing in wireless lan: Algorithms and evaluation. Manuscript, 2005.
8. N. BANSAL, A. BLUM, S. CHAWLA, AND A. MEYERSON, Approximation algorithms for deadline-TSP and vehicle routing with time-windows, in Proc. 36th Annual ACM Sympos, Theory of Computing, 2004, pp. 166-174.
9. [9J R. BAR-YEHUDA, O. GOLDREICH, AND A. ITAI, On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization. Journal of Computer and System Sciences, 45 (1992), pp. 104-126.
10. I. CHLAMTAC AND O. WEINSTEIN, The wave expansion approach to broadcasting in multi-hop radio networks, IEEE Transactions on Communications, 39 (1991).
11. J. CHUZHOY, S. GUHA, E. HALPERI, S. KHANNA, G. KORTSARZ, AND J. S. NAOR, Asymmetric k-center is log* n-hard to approximate, in Proc. 36th Annual ACM Sympos. Theory of Computing, 2004, pp. 21-27.
12. X. DENG, C. PAPADIMITRIOU, AND S. SAFRA, On the complexity of equilibria, in Proc. 34th Annual ACM Sympos. Theory of Computing, 2002, pp. 67-71.
13. N. R. DEVANUR, C. H. PAPADIMITRIOU, A. SABERI, AND V. V. VAZIRANI, Market equilibrium via a primal-dual-type algorithm, in Proc. 43rd Sympos. Foundations of Computer Science, 2002, pp. 389-395.
14. M. ELKIN AND G. KORTSARZ, Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem, in Proc. 34th Annual ACM Sympos. Theory of Computing, 2002, pp. 438-447.
15. _, Polylogarithmic inapproximability of the radio broadcast problem, in Proc. 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, 2004, pp. 105-116.
16. U. FEIGE, A threshold of Inn for approximating set cover, Journal of the ACM, 45 (1998), pp. 634-652.
17. _, Relations between average case complexity and approximation complexity, in Proc. 34th Annual ACM Sympos. Theory of Computing. 2002. pp. 534-543.
18. U. FEIGE, M. M. HALLDÓRSSON, G. KORTSARZ, AND A. SRINIVASAN. Approximating the domatic number, SIAM Journal on Computing, 32 (2002), pp. 172-195.
19. Y. FUKUDA, T. ABE, AND Y. OIE, Decentralized access point selection architecture for wireless lans - deployability and robustness for wireless lans, in In Proc. of IEEE VTC, September 2004.
20. L. GASIENIEC, D. PELEG, AND Q. XIN, Faster communication in known topology radio networks, in Proc. 24th Annual ACM SIGACT-SIGOPS Sympos. Principles of Distributed Computing, 2005, pp. 129-137.
21. M. X. GOEMANS AND D. P. WILLIAMSON, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42 (1995). pp. 1115-1145.
22. S. GUHA AND S. KHULLER, Greedy strikes back: improved facility location algorithms. Journal of Algorithms, 31 (1999), pp. 228-248.
23. F. GUL AND E. STACCHETTI, Walrasian equilibrium with gross substitutes. Journal of Economic Theory, 87 (1999), pp. 95-124.
24. V. GURUSWAMI, J. D. HARTLINE, A. R. KARLIN, D. KEMPE, C. KENYON, AND F. MCSHERRY, On profit-maximizing envy-free pricing, in Proc. 16th Annual ACMSIAM Sympos. Discrete Algorithms, 2005, pp. 1164-1173.
25. V. GURUSWAMI AND L. TREVISAN, The complexity of making unique choices: Approximating 1-in-k SAT, in Proc. 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, vol. 3624 of Lecture Notes in Computer Science, 2005, pp. 99-110.
26. J. HÅSTAD, Some optimal inapproximability results, in Proc. 29th Annual ACM Sympos. Theory of Computing, 1997, pp. 1-10.
27. D. S. HOCHBAUM, Approximating covering and packing problems: set cover, vertex cover, independent set and related problems, in Approximation algorithms for NP-hard problems, PWS Publishing Co., Boston, 1997, pp. 94-143.
28. G. JUDD AND P. STEENKISTE, Fixing 802.11 access point selection, in ACM SIGCOMM Poster, August 2002.
29. S. KHULLER, A. Moss, AND J. S. NAOR, The budgeted maximum coverage problem, Information Processing Letters, 70 (1999), pp. 39-45.
30. D. R. KOWALSKI AND A. PELC, Broadcasting in undirected ad hoc radio networks, in Proc. 22nd Annual Sympos. Principles of Distributed Computing, 2003, pp. 73-82.
31. _, Centralized deterministic broadcasting in undirected multi-hop radio networks, in Proc. 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, 2004, pp. 171-182.
32. _, Time of deterministic broadcasting in radio networks with local knowledge, SIAM Journal on Computing, 33 (2004), pp. 870-891.
33. E. KUSHILEVITZ AND Y. MANSOUR, An ω(d log(n/d)) lower bound for broadcast in radio networks, SIAM Journal on Computing, 27 (1998), pp. 702-712.
34. D. LEHMANN, L. I. O'CALLAGHAN, AND Y. SHOHAM, Truth revelation in approximately efficient combinatorial auctions, in Proc. 1st ACM Conference on Electronic Commerce, 1999, pp. 96-102.
35. N. LEV-TOV AND D. PELEG, Exact algorithms and approximation schemes for base station placement problems, in Proc. 8th Scandinavian Workshop on Algorithm Theory, vol. 2368 of Lecture Notes in Computer Science, 2002, pp. 90-99.
36. C. LUND AND M. YANNAKAKIS, On the hardness of approximating minimization problems, Journal of the ACM, 41 (1994), pp. 960-981.
37. A. MOSS AND Y. RABANI, Approximation algorithms for constrained for constrained node weighted steiner tree problems, In Proc. 33rd Annual ACM Sympos. Theory of Computing, 2001, pp. 373-382.
38. R. MOTWANI AND P. RAGHAVAN, Randomized Algorithms, Cambridge University Press, 1995.
39. A. MU'ALEM AND N. NISAN, Truthful approximation mechanisms for restricted combinatorial auctions: extended abstract, in 18th National Conference on Artificial Intelligence. 2002, pp. 379-384.
40. C. H. PAPADIMITRIOU AND M. YANNAKAKIS, Optimization, approximation, and complexity classes. Journal of Computer and System Sciences, 43 (1991), pp. 425-440.
41. R. RAZ AND S. SAFRA, A sub-constant error-probability low-degree test, and a sub-constant error-probability pep characterization of np, In Proc. 29th Annual ACM Sympos. Theory of Computing, 1997, pp. 475-484.
42. M. R. SALAVATIPOUR. AND J. VERTRAETE, Disjoint cycles: Integrality gap, hardness and approximation, in Proc. 11th Conference on Integer Programming and Combinatorial Optimization, 2005, pp. 51-65.
43. L. WALRAS, Elements of Pure Economics, Allen and Unwin, 1954.