Finding a maximal weighted independent set in wireless networks

DOI10.1023/A:1016747704458zbMath1020.68005OpenAlexW1599688444MaRDI QIDQ5955442

Stefano Basagni

Publication date: 13 February 2002

Published in: Telecommunication Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1016747704458

zbMATH Keywords

random graphsdistributed algorithmMWIS

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (9)

Minimum-energy wireless real-time multicast by joint network coding and scheduling optimization ⋮ Responsive strategic oscillation for solving the disjunctively constrained knapsack problem ⋮ Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket ⋮ Robust maximum weighted independent-set problems on interval graphs ⋮ Listing Maximal Independent Sets with Minimal Space and Bounded Delay ⋮ A new distributed approximation algorithm for the maximum weight independent set problem ⋮ Algorithms for the generalized independent set problem based on a quadratic optimization approach ⋮ Solving maximum independent set by asynchronous distributed hopfield-type neural networks ⋮ Dynamic node packing

This page was built for publication: Finding a maximal weighted independent set in wireless networks