By Topic

Maximum weighted matching with interference constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
G. Sharma ; Center for Wireless Syst. & Applications, Purdue Univ., West Lafayette, IN, USA ; N. B. Shroff ; R. R. Mazumdar

In this paper, we study the problem of utility maximization in multi-hop wireless systems. To study the effect of wireless interference constraints on the utility maximization problem, we introduce a new class of weighted matching problems, namely maximum weighted K-valid matching problems (MWKVMPs). For K = 1, MWKVMP corresponds to the well studied maximum weighted matching problem (MWMP) in the literature, which can be solved in polynomial time. We prove several interesting results concerning the hardness of these problems for K ges 2. In particular, we show that MWKVMP does not even belong to APX; where APX denotes the class of problems to which a constant factor approximation can be obtained in polynomial time. Our results have strong implications concerning the hardness of scheduling transmissions in multi-hop wireless systems

Published in:

Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06)

Date of Conference:

13-17 March 2006