Interference in cellular networks: The Minimum Membership Set Cover problem

Lecture Notes in Computer Science

Volumn 3595, Issue , 2005, Pages 188-198

  Kuhn, Fabian ^a   Von Rickenbach, Pascal ^a   Wattenhofer, Roger ^a   Welzl, Emo ^a   Zollinger, Aaron ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; LINEAR PROGRAMMING; OPTIMIZATION; POLYNOMIALS; RADIO INTERFERENCE; RELAXATION PROCESSES; TELECOMMUNICATION NETWORKS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; MOBILE TELECOMMUNICATION SYSTEMS; POLYNOMIAL APPROXIMATION;

ASYMPTOTICAL MATCHES; CELLULAR NETWORKS; MOBILE DISTRIBUTED TASKS; OPTIMIZATION PROBLEMS; CELLULAR NETWORK; COMBINATORIAL OPTIMIZATION PROBLEMS; INTERFERENCE REDUCTION; LINEAR PROGRAMMING RELAXATION; OPTIMAL SOLUTIONS; SET COVER PROBLEM; TRANSMISSION POWER LEVELS;

CELLULAR RADIO SYSTEMS; WIRELESS NETWORKS;

EID: 26844518455     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11533719_21     Document Type: Conference Paper

References (13)

1. V. Chvátal. A Greedy Heuristic for the Set-Covering Problem. Mathematics of Operations Research, 4(3):233-235, 1979.
2. rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2002.
3. U. Feige. A Threshold of In n for Approximating Set Cover. Journal of the ACM (JACM), 45(4):634-652, 1998.
4. C. Fortuin, P. Kasteleyn, and J. Ginibre. Correlations Inequalities on Some Partially Ordered Sets. Comm. Math. Phys., 22:89-103, 1971.
5. T. E. Harris. A Lower Bound for the Critical Probability in a Certain Percolation Process. Proc. Cambridge Philos. Soc., 60:13-20, 1960.
6. J. Janssen. Channel Assignment and Graph Labeling. In I. Stojmenovic, editor, Handbook of Wireless Networks and Mobile Computing, chapter 5, pages 95-117. John Wiley & Sons, Inc., 2002.
7. D. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9:256-278, 1974.
8. D. Kleitman. Families of Non-Disjoint Subsets. Journal of Combinatorial Theory, 1:153-155, 1966.
9. C.-J. Lu. A Deterministic Approximation Algorithm for a Minimax Integer Programming Problem. In Proc. of the 10th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 663-668, 1999.
10. C. Lund and M. Yannakakis. On the Hardness of Approximating Minimization Problems. Journal of the ACM, 41(5):960-981, 1994.
11. L. Narayanan. Channel Assignment and Graph Multicoloring. In I. Stojmenovic, editor, Handbook of Wireless Networks and Mobile Computing, chapter 4, pages 71-94. John Wiley & Sons, Inc., 2002.
12. P. Raghavan and C. Thompson. Randomized Rounding: A Technique for Provably Good Algorithms and Algorithmic Proofs. Combinatorica, 7(4):365-374, 1987.
13. A. Srinivasan. Improved Approximations of Packing and Covering Problems. In Proc. of the 27th ACM Symposium on Theory of Computing, pages 268-276, 1995.