Maximal Packing with Interference Constraints
Rakshith Jagannath, Radha Krishna Ganti, Neelesh S Upadhye
TL;DR
This paper addresses the complex problem of scheduling maximum concurrent transmitters under interference constraints, proposing a semi-definite relaxation approach to approximate solutions for an NP-hard problem.
Contribution
It introduces a semi-definite relaxation method for the interference-constrained packing problem and provides bounds on the relaxation's performance.
Findings
SDR provides bounds on the optimal solution
The problem is NP-hard and challenging to solve exactly
Proposed relaxation offers a tractable approximation method
Abstract
In this work, we study the problem of scheduling a maximal set of transmitters subjected to an interference constraint across all the nodes. Given a set of nodes, the problem reduces to finding the maximum cardinality of a subset of nodes that can concurrently transmit without violating interference constraints. The resulting packing problem is a binary optimization problem and is NP hard. We propose a semi-definite relaxation (SDR) for this problem and provide bounds on the relaxation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.