scientific article; zbMATH DE number 7650099

DOI10.4230/LIPICS.APPROX-RANDOM.2019.32MaRDI QIDQ5875486zbMATH OpenFDO

Authors Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Joseph S. B. Mitchell, Nabil H. Mustafa

Publication date 3 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2019.32

zbMATH Keywords

approximation algorithmconnectivity constraintsubmodular function optimisationunit disk graph

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Cites work

• An analysis of approximations for maximizing submodular set functions—I
• Analyzing the optimal neighborhood: algorithms for budgeted and partial connected dominating set problems
• Geometric Spanner Networks
• scientific article; zbMATH DE number 1323125 (Why is no real title available?)
• scientific article; zbMATH DE number 1507300 (Why is no real title available?)
• scientific article; zbMATH DE number 7378687 (Why is no real title available?)
• Improved results on geometric hitting set problems
• Maximizing a monotone submodular function subject to a matroid constraint
• Maximizing submodular set functions subject to multiple linear constraints
• Monotone submodular maximization over a matroid via non-oblivious local search
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Simple heuristics for unit disk graphs
• Submodular function maximization via the multilinear relaxation and contention resolution schemes
• Submodular maximization over multiple matroids via generalized exchange properties

Cited in

(1)

• Energy-constrained geometric coverage problem

This page was built for publication:

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