×

Found 1,095 Documents (Results 1–100)

Estimating the clustering coefficient using sample complexity analysis. (English) Zbl 07719353

Castañeda, Armando (ed.) et al., Latin 2022: theoretical informatics. 15th Latin American symposium, Guanajuato, Mexico, November 7–11, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13568, 328-341 (2022).
MSC:  68Qxx 68Rxx 68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Coresets for \((k, \ell ) \)-median clustering under the Fréchet distance. (English) Zbl 07683171

Balachandran, Niranjan (ed.) et al., Algorithms and discrete applied mathematics. 8th international conference, CALDAM 2022, Puducherry, India, February 10–12, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13179, 167-180 (2022).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Some problems related to the space of optimal tree reconciliations (invited talk). (English) Zbl 07556556

Mutzel, Petra (ed.) et al., WALCOM: algorithms and computation. 16th international conference and workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13174, 3-14 (2022).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

A graph-based similarity approach to classify recurrent complex motifs from their context in RNA structures. (English) Zbl 07700601

Coudert, David (ed.) et al., 19th international symposium on experimental algorithms, SEA 2021, Nice, France, June 7–9, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 190, Article 19, 18 p. (2021).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Fréchet mean and \(p\)-mean on the unit circle: decidability, algorithm, and applications to clustering on the flat torus. (English) Zbl 07700597

Coudert, David (ed.) et al., 19th international symposium on experimental algorithms, SEA 2021, Nice, France, June 7–9, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 190, Article 15, 16 p. (2021).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Improved analysis of online balanced clustering. (English) Zbl 07603894

Koenemann, Jochen (ed.) et al., Approximation and online algorithms. 19th international workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12982, 224-233 (2021).
MSC:  68W25 68W27
PDF BibTeX XML Cite
Full Text: DOI arXiv

Parameterized complexity of categorical clustering with size constraints. (English) Zbl 07498691

Lubiw, Anna (ed.) et al., Algorithms and data structures. 17th international symposium, WADS 2021, virtual event, August 9–11, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12808, 385-398 (2021).
MSC:  68P05 68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Distributed detection of clusters of arbitrary size. (English) Zbl 07495150

Jurdziński, Tomasz (ed.) et al., Structural information and communication complexity. 28th international colloquium, SIROCCO 2021, Wrocław, Poland, June 28 – July 1, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12810, 370-387 (2021).
MSC:  68Mxx 68Q11 68R10
PDF BibTeX XML Cite
Full Text: DOI

A distributed algorithm for spectral sparsification of graphs with applications to data clustering. (English) Zbl 1483.68259

Gentile, Claudio (ed.) et al., Graphs and combinatorial optimization: from theory to applications. Proceedings of the 18th Cologne-Twente workshop on graphs and combinatorial optimization (CTW2020), online, September 14–16, 2020. Cham: Springer. AIRO Springer Ser. 5, 403-413 (2021).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the size of the clusters: complexity and approximability. (English. Russian original) Zbl 07377486

Proc. Steklov Inst. Math. 313, Suppl. 1, S117-S124 (2021); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 25, No. 4, 69-78 (2019).
MSC:  68W25
PDF BibTeX XML Cite
Full Text: DOI

Capacitated sum-of-radii clustering: an FPT approximation. (English) Zbl 07651201

Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 62, 17 p. (2020).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Fully-dynamic coresets. (English) Zbl 07651196

Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 57, 21 p. (2020).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Polynomial time approximation schemes for clustering in low highway dimension graphs. (English) Zbl 07651185

Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 46, 22 p. (2020).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Approximation algorithms for clustering with dynamic points. (English) Zbl 07651176

Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 37, 15 p. (2020).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Reconstructing biological and digital phylogenetic trees in parallel. (English) Zbl 07651142

Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 3, 24 p. (2020).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

An improved approximation algorithm for the prize-collecting red-blue median problem. (English) Zbl 1517.68417

Chen, Jianer (ed.) et al., Theory and applications of models of computation. 16th international conference, TAMC 2020, Changsha, China, October 18–20, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12337, 94-106 (2020).
MSC:  68W25 90B80
PDF BibTeX XML Cite
Full Text: DOI

Graph clustering in all parameter regimes. (English) Zbl 07559410

Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 39, 15 p. (2020).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs. (English) Zbl 1482.68176

Zhang, Zhao (ed.) et al., Algorithmic aspects in information and management. 14th international conference, AAIM 2020, Jinhua, China, August 10–12, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12290, 97-107 (2020).
MSC:  68R10 05C70 68W25
PDF BibTeX XML Cite
Full Text: DOI

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software