Max-min four-dispersion problems

DOI10.1007/978-981-95-4839-2_21MaRDI QIDQ7290084zbMATH OpenFDO

Authors Shin-Ichi Nakano

Publication date 6 July 2026

Full work available at URL https://doi.org/10.1007/978-981-95-4839-2_21

Mathematics Subject Classification ID

No records found.

Cites work

• A study on two geometric location problems
• An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs
• Approximation algorithms for dispersion problems
• Approximation algorithms for maximum dispersion
• Approximation Guarantees for Max Sum and Max Min Facility Dispersion with Parameterised Triangle Inequality and Applications in Result Diversification
• Dynamic facility location: The progressive p-median problem
• Exact algorithms for the max-min dispersion problem
• Heuristic and Special Case Algorithms for Dispersion Problems
• scientific article; zbMATH DE number 432817 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 1182762 (Why is no real title available?)
• Local Search for Max-Sum Diversification
• Max-Min 3-Dispersion problems
• Max-min dispersion on a line
• Maximum dispersion and geometric maximum weight cliques
• The discrete p-dispersion problem

This page was built for publication: Max-min four-dispersion problems

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