On Finding the Jaccard Center

DOI10.4230/LIPICS.ICALP.2017.23zbMATH Open1441.68067OpenAlexW2742148040MaRDI QIDQ5111353FDOQ5111353

Marc Bury, Chris Schwiegelshohn

Publication date: 27 May 2020

Full work available at URL: https://dblp.uni-trier.de/db/conf/icalp/icalp2017.html#BuryS17

zbMATH Keywords

clustering1-centerJaccard center

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parameterized complexity, tractability and kernelization (68Q27)

Cited In (1)

• Polynomial time approximation schemes for all 1-center problems on metric rational set similarities

   Recommendations

• Title not available (Why is that?) 👍 👎
• Polynomial time approximation schemes for all 1-center problems on metric rational set similarities 👍 👎
• An Algorithm for the Single Facility Location Problem Using the Jaccard Metric 👍 👎
• Title not available (Why is that?) 👍 👎
• Efficient approximation algorithms for clustering point-sets 👍 👎

This page was built for publication: On Finding the Jaccard Center

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