×

Found 126 Documents (Results 1–100)

100
MathJax

Diversity maximization in doubling metrics. (English) Zbl 07561387

Hsu, Wen-Lian (ed.) et al., 29th international symposium on algorithms and computation, ISAAC 2018, December 16–19, 2018, Jiaoxi, Yilan, Taiwan. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 123, Article 33, 12 p. (2018).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Constant-space population protocols for uniform bipartition. (English) Zbl 1487.68026

Aspnes, James (ed.) et al., 21st international conference on principles of distributed systems, OPODIS 2017, Lisboa, Portugal, December 18–20, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 95, Article 19, 17 p. (2018).
MSC:  68M12 68M14
PDF BibTeX XML Cite
Full Text: DOI

An efficient fixed-parameter algorithm for the 2-plex bipartition problem. (English) Zbl 1457.68209

Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 20, 13 p. (2017).
MSC:  68R10 68Q27 68W05
PDF BibTeX XML Cite
Full Text: DOI

A polynomial-time bicriteria approximation scheme for planar bisection. (English) Zbl 1321.68501

Proceedings of the 47th annual ACM symposium on theory of computing, STOC ’15, Portland, OR, USA, June 14–17, 2015. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3536-2). 841-850 (2015).
PDF BibTeX XML Cite
Full Text: DOI arXiv

A \(k\)-way graph partitioning algorithm based on clustering by eigenvector. (English) Zbl 1082.05085

Bubak, Marian (ed.) et al., Computational science – ICCS 2004. 4th international conference, Kraków, Poland, June 6–9, 2004. Proceedings, Part II. Berlin: Springer (ISBN 3-540-22115-8/pbk). Lecture Notes in Computer Science 3037, 598-601 (2004).
MSC:  05C85 68R10
PDF BibTeX XML Cite
Full Text: DOI

Rank-two relaxation heuristics for max-cut problem. (English) Zbl 1004.90054

Lenart, L. (ed.) et al., SOR ’01. Proceedings of the 6th international symposium on operational research in Slovenia, Preddvor, Slovenia, September 26-28, 2001. Ljubljana: Slovenian Society Informatika, Section for Operational Research. 59-64 (2001).
PDF BibTeX XML Cite

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Classification

all top 3

Software