Performance Guarantees of Distributed Algorithms for QoS in Wireless Ad Hoc Networks
- 1 February 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 28 (1) , 182-195
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- The performance of an upper bound on the fractional chromatic number of weighted graphsApplied Mathematics Letters, 2010
- Sufficient conditions for flow admission control in wireless ad-hoc networksACM SIGMOBILE Mobile Computing and Communications Review, 2005
- Computing Reliability and Message Delay for Cooperative Wireless Distributed Sensor Networks Subject to Random FailuresIEEE Transactions on Reliability, 2005
- Graph ImperfectionJournal of Combinatorial Theory, Series B, 2001
- The capacity of wireless networksIEEE Transactions on Information Theory, 2000
- On the hardness of approximating minimization problemsJournal of the ACM, 1994
- Link scheduling in polynomial timeIEEE Transactions on Information Theory, 1988
- On maximal independent sets of vertices in claw-free graphsJournal of Combinatorial Theory, Series B, 1980
- Line perfect graphsMathematical Programming, 1977
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965