Online set multicover algorithms for dynamic D2D communications

DOI10.1007/S10878-017-0144-YzbMATH Open1381.90060OpenAlexW2623789141MaRDI QIDQ1679520FDOQ1679520

Authors: Alan Kuhnle, Xiang Li, Jeffrey Smith, My T. Thai 

Publication date: 9 November 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-017-0144-y

Recommendations

• Online and dynamic algorithms for set cover
• The online set cover problem
• The online set cover problem
• Approximating the online set multicover problems via randomized winnowing
• scientific article; zbMATH DE number 6696496

zbMATH Keywords

optimizationresource allocationonline algorithmset multicoverD2D communications

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Integer programming (90C10)

Cites Work

• Online primal-dual algorithms for covering and packing
• The online set cover problem
• Admission control to minimize rejections and online set cover with repetitions

Cited In (1)

• Algorithms and Data Structures

This page was built for publication: Online set multicover algorithms for dynamic D2D communications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1679520)