scientific article; zbMATH DE number 7650099

DOI10.4230/LIPIcs.APPROX-RANDOM.2019.32MaRDI QIDQ5875486

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

Publication date: 3 February 2023

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximation algorithmunit disk graphconnectivity constraintsubmodular function optimisation

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved results on geometric hitting set problems
• Connecting a set of circles with minimum sum of radii
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
• Geometric Spanner Networks
• An analysis of approximations for maximizing submodular set functions—I
• Simple heuristics for unit disk graphs
• Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
• Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems
• Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search
• Submodular Maximization over Multiple Matroids via Generalized Exchange Properties

This page was built for publication: