The k-centre problem for classes of cyclic words

DOI10.1007/978-3-031-23101-8_26MaRDI QIDQ6169545zbMATH OpenOpenAlexFDO

Authors Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov

Publication date 14 August 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-23101-8_26

Mathematics Subject Classification ID

Combinatorics on words (68R15) Approximation algorithms (68W25) Algorithms on strings (68W32) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 1305511
• On the closest string and substring problems
• Exact and approximation algorithms for clustering
• Combinatorial Pattern Matching
• Complexities of the centre and median string problems

Cites work

• Approximation algorithms for NP-hard problems.
• Computing k-th Lyndon word and decoding lexicographically minimal de Bruijn sequence
• Distinguishing string selection problems.
• Efficient indexing of necklaces and irreducible polynomials over finite fields
• Generating necklaces
• scientific article; zbMATH DE number 1696649 (Why is no real title available?)
• scientific article; zbMATH DE number 4074514 (Why is no real title available?)
• scientific article; zbMATH DE number 1305511 (Why is no real title available?)
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 1024080 (Why is no real title available?)
• Locating patterns in the de Bruijn torus
• New constructions for De Bruijn tori
• On covering problems of codes
• On the closest string and substring problems
• On the de Bruijn torus problem
• On the existence of de Bruijn tori with two by two windows
• On the hardness of energy minimisation for crystal structure prediction
• On the hardness of energy minimisation for crystal structure prediction
• Quick k-Median, k-Center, and Facility Location for Sparse Graphs
• Ranking binary unlabelled necklaces in polynomial time
• Ranking Bracelets in Polynomial Time.
• The non-uniform k-center problem
• The parameterized hardness of the \(k\)-center problem in transportation networks
• Toroidal codes and conjugate pictures
• Universal cycles for combinatorial structures

Cited in

(1)

• Tiling of toroidal arrays with pictures: uniqueness, shift-equivalence and undecidability

This page was built for publication: The k-centre problem for classes of cyclic words

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