Amanote Research

Amanote Research

    RegisterSign In

Approximation Algorithms for Computing Capacity of Wireless Networks With SINR Constraints

doi 10.1109/infocom.2008.172
Full Text
Open PDF
Abstract

Available in full text

Date

April 1, 2008

Authors
Deepti ChafekarV.S. Anil KumarMadhav V. MaratheSrinivasan ParthasarathyArvind Srinivasan
Publisher

IEEE


Related search

Optimal Algorithms and Approximation Algorithms for Replica Placement With Distance Constraints in Tree Networks

2012English

Approximation Algorithms for Geometric Networks

English

Cross-Layer Throughput Optimization in Cognitive Radio Networks With SINR Constraints

International Journal of Digital Multimedia Broadcasting
CommunicationMedia TechnologyElectricalElectronic Engineering
2010English

Distributed CSMA Algorithms for Link Scheduling in Multihop MIMO Networks Under SINR Model

IEEE/ACM Transactions on Networking
Electronic EngineeringComputer NetworksCommunicationsComputer Science ApplicationsElectricalSoftware
2013English

Capacity of Wireless Networks With Heterogeneous Traffic

2009English

Multi-Dimensional Conflict Graph Based Computing for Optimal Capacity in MR-MC Wireless Networks

2010English

The K-Constrained Bipartite Matching Problem: Approximation Algorithms and Applications to Wireless Networks

2010English

Nonlinear Gossip Algorithms for Wireless Sensor Networks

Journal of Applied Mathematics
Applied Mathematics
2014English

Cooperative Clustering Algorithms for Wireless Sensor Networks

2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy