scientific article; zbMATH DE number 7650099

DOI10.4230/LIPICS.APPROX-RANDOM.2019.32MaRDI QIDQ5875486FDOQ5875486

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

Publication date: 3 February 2023

Title of this publication is not available (Why is that?)

zbMATH Keywords

approximation algorithmunit disk graphconnectivity constraintsubmodular function optimisation

Mathematics Subject Classification ID

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

Cites Work

• Monotone submodular maximization over a matroid via non-oblivious local search
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Geometric Spanner Networks
• Improved results on geometric hitting set problems
• Maximizing a monotone submodular function subject to a matroid constraint
• An analysis of approximations for maximizing submodular set functions—I
• Analyzing the optimal neighborhood: algorithms for budgeted and partial connected dominating set problems
• Submodular maximization over multiple matroids via generalized exchange properties
• Submodular function maximization via the multilinear relaxation and contention resolution schemes
• Maximizing submodular set functions subject to multiple linear constraints
• Simple heuristics for unit disk graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Connecting a set of circles with minimum sum of radii

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)