Submodular formulations for range assignment problems

DOI10.1016/J.ENDM.2010.05.031zbMATH Open1237.90129OpenAlexW2031748400MaRDI QIDQ2883570FDOQ2883570

Authors: Frank Baumann, Christoph Buchheim 

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.031

Recommendations

• scientific article; zbMATH DE number 1500550
• scientific article; zbMATH DE number 1670654
• The minimum range assignment problem on linear radio networks
• Recent Advances on Approximation Algorithms for Minimum Energy Range Assignment Problems in Ad-Hoc Wireless Networks
• Some valid inequalities for the probabilistic minimum power multicasting problem

zbMATH Keywords

wireless networksrange assignmentsubmodular functions

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Integer programming (90C10) Discrete location and assignment (90B80)

Cites Work

• Title not available (Why is that?)
• On the hardness of range assignment problems
• Optimal solutions to minimum total energy broadcasting problem in wireless ad hoc networks
• Polymatroids and mean-risk minimization in discrete optimization
• Exact algorithms for the minimum power symmetric connectivity problem in wireless networks
• Minimum power multicasting problem in wireless networks

This page was built for publication: Submodular formulations for range assignment problems

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