From post

Distributed approximation algorithms for maximum link scheduling and local broadcasting in the physical interference model.

, и . INFOCOM, стр. 1339-1347. IEEE, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Clearing secondary spectrum market with spatio-temporal partitioning., , , , , и . DySPAN, стр. 358-367. IEEE, (2012)Analysis of policy instruments for enhanced competition in spectrum auction., , , , , и . DySPAN, стр. 89-96. IEEE, (2012)Distributed approximation algorithms for maximum link scheduling and local broadcasting in the physical interference model., и . INFOCOM, стр. 1339-1347. IEEE, (2013)Subgraph Enumeration in Dynamic Graphs., , и . ICDM, стр. 11-20. IEEE Computer Society, (2013)On Dense Subgraphs in Signed Network Streams., , и . ICDM, стр. 51-60. IEEE Computer Society, (2016)Approximation Algorithms for Reducing the Spectral Radius to Control Epidemic Spread., , , и . CoRR, (2015)Brief Announcement: Distributed Algorithms for Maximum Link Scheduling in the Physical Interference Model., и . DISC, том 7611 из Lecture Notes in Computer Science, стр. 407-408. Springer, (2012)Modeling the Interaction between Emergency Communications and Behavior in the Aftermath of a Disaster., , , , , , , и . SBP, том 7812 из Lecture Notes in Computer Science, стр. 476-485. Springer, (2013)How Robust Is the Core of a Network?, и . ECML/PKDD (1), том 8188 из Lecture Notes in Computer Science, стр. 541-556. Springer, (2013)Parallel Generation of Large-Scale Random Graphs.. IPDPS Workshops, стр. 278. IEEE Computer Society, (2018)