Away from each other

DOI10.1007/978-3-031-27051-2_6MaRDI QIDQ6091146

Shin-ichi Nakano, Tetsuya Araki

Publication date: 24 November 2023

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dispersion in disks
• Exact algorithms for the max-min dispersion problem
• The discrete p-dispersion problem
• A study on two geometric location problems
• Approximation algorithms for maximum dispersion
• Systems of distant representatives
• Optimal shortest path queries in a simple polygon
• Maximum dispersion and geometric maximum weight cliques
• An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs
• Approximation Algorithms for Dispersion Problems
• Max-sum diversity via convex programming
• Approximation algorithms for spreading points
• Heuristic and Special Case Algorithms for Dispersion Problems
• Local Search for Max-Sum Diversification
• Dispersing Points on Intervals
• Approximation Guarantees for Max Sum and Max Min Facility Dispersion with Parameterised Triangle Inequality and Applications in Result Diversification
• Max-min dispersion on a line

This page was built for publication: Away from each other