The k-centre problem for classes of cyclic words
From MaRDI portal
Publication:6169545
DOI10.1007/978-3-031-23101-8_26OpenAlexW4313429529MaRDI QIDQ6169545
Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov, Duncan Adamson
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
Analysis of algorithms (68W40) Combinatorics on words (68R15) Approximation algorithms (68W25) Algorithms on strings (68W32)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On covering problems of codes
- On the de Bruijn torus problem
- Locating patterns in the de Bruijn torus
- Universal cycles for combinatorial structures
- Distinguishing string selection problems.
- New constructions for De Bruijn tori
- Ranking binary unlabelled necklaces in polynomial time
- Toroidal codes and conjugate pictures
- On the existence of de Bruijn tori with two by two windows
- On the closest string and substring problems
- On the Hardness of Energy Minimisation for Crystal Structure Prediction
- Generating necklaces
- Quick k-Median, k-Center, and Facility Location for Sparse Graphs
- The Parameterized Hardness of the k-Center Problem in Transportation Networks
- Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence
- On the Hardness of Energy Minimisation for Crystal Structure Prediction*
- Ranking Bracelets in Polynomial Time.
This page was built for publication: The k-centre problem for classes of cyclic words
