The k-centre problem for classes of cyclic words
From MaRDI portal
Publication:6169545
DOI10.1007/978-3-031-23101-8_26OpenAlexW4313429529MaRDI QIDQ6169545FDOQ6169545
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
Recommendations
Analysis of algorithms (68W40) Approximation algorithms (68W25) Combinatorics on words (68R15) Algorithms on strings (68W32)
Cites Work
- Computing \(k\)-th Lyndon word and decoding lexicographically minimal de Bruijn sequence
- Approximation algorithms for NP-hard problems.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distinguishing string selection problems.
- On the closest string and substring problems
- On covering problems of codes
- Universal cycles for combinatorial structures
- Generating necklaces
- Title not available (Why is that?)
- On the de Bruijn torus problem
- Quick k-Median, k-Center, and Facility Location for Sparse Graphs
- The parameterized hardness of the \(k\)-center problem in transportation networks
- New constructions for De Bruijn tori
- On the existence of de Bruijn tori with two by two windows
- Locating patterns in the de Bruijn torus
- Title not available (Why is that?)
- The non-uniform \(k\)-center problem
- On the hardness of energy minimisation for crystal structure prediction
- Toroidal codes and conjugate pictures
- Ranking binary unlabelled necklaces in polynomial time
- Efficient indexing of necklaces and irreducible polynomials over finite fields
- On the hardness of energy minimisation for crystal structure prediction
- Ranking Bracelets in Polynomial Time.
- Title not available (Why is that?)
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)
