SIAM Review
Approximate graph coloring by semidefinite programming
Journal of the ACM (JACM)
Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximating coloring and maximum independent sets in 3-uniform hypergraphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Comparison between graph-based and interference-based STDMA scheduling
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Coloring k-colorable graphs using relatively small palettes
Journal of Algorithms
Topology control meets SINR: the scheduling complexity of arbitrary topologies
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Cross-layer latency minimization in wireless networks with SINR constraints
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Improved Approximation Guarantees through Higher Levels of SDP Hierarchies
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
A measurement study of interference modeling and scheduling in low-power wireless networks
Proceedings of the 6th ACM conference on Embedded network sensor systems
Improved Algorithms for Latency Minimization in Wireless Networks
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Wireless Communication Is in APX
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Oblivious interference scheduling
Proceedings of the 28th ACM symposium on Principles of distributed computing
A better approximation ratio for the vertex cover problem
ACM Transactions on Algorithms (TALG)
Distributed contention resolution in wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
Approximation algorithms for secondary spectrum auctions
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
The topology of wireless communication
Proceedings of the forty-third annual ACM symposium on Theory of computing
Nearly optimal bounds for distributed wireless scheduling in the SINR model
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Convergence time of power-control dynamics
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
Given a set of wireless links, a fundamental problem is to find the largest subset that can transmit simultaneously, within the SINR model of interference. Significant progress on this problem has been made in recent years. In this note, we study the problem in the setting where we are given a fixed set of arbitrary powers each sender must use, and an arbitrary gain matrix defining how signals fade. This variation of the problem appears immune to most algorithmic approaches studied in the literature. Indeed it is very hard to approximate since it generalizes the max independent set problem. Here, we propose a simple semi-definite programming approach to the problem that yields constant factor approximation, if the optimal solution is strictly larger than half of the input size.