On covering problems of codes
From MaRDI portal
Publication:675858
DOI10.1007/BF02679443zbMath0868.94056OpenAlexW2077595184MaRDI QIDQ675858
Publication date: 17 August 1997
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02679443
Analysis of algorithms and problem complexity (68Q25) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Related Items (56)
Recurrent Genetic Algorithms: Sustaining Evolvability ⋮ Configurations and minority in the string consensus problem ⋮ On some optimization problems in molecular biology ⋮ Mathematical programming formulations for the efficient solution of the \(k\)-sum approval voting problem ⋮ A combinedgreedy-walkheuristic and simulated annealing approach for the closest string problem ⋮ Efficient Algorithms for the Closest String and Distinguishing String Selection Problems ⋮ Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem ⋮ The consensus string problem for a metric is NP-complete ⋮ Approximation algorithms for Hamming clustering problems ⋮ Two-string consensus problem under non-overlapping inversion and transposition distance ⋮ Finding Consensus Strings with Small Length Difference Between Input and Solution Strings ⋮ On approximating string selection problems with outliers ⋮ Submodular reassignment problem for reallocating agents to tasks with synergy effects ⋮ On the hardness of the consensus string problem ⋮ The complexity of binary matrix completion under diameter constraints ⋮ Fairness in temporal slot assignment ⋮ The approximate period problem for DNA alphabet. ⋮ A three-string approach to the closest string problem ⋮ The k-centre problem for classes of cyclic words ⋮ On the string consensus problem and the Manhattan sequence consensus problem ⋮ On the parameterized complexity of clustering problems for incomplete data ⋮ Using small-scale quantum devices to solve algebraic equations ⋮ Unnamed Item ⋮ Combinatorial \(n\)-fold integer programming and applications ⋮ An optimization modelling for string selection in molecular biology using Pareto optimality ⋮ Tight Hardness Results for Consensus Problems on Circular Strings and Time Series ⋮ Improved optimization modelling for the closest string and related problems ⋮ On the complexity of finding common approximate substrings. ⋮ Distinguishing string selection problems. ⋮ On some multiobjective optimization problems arising in biology ⋮ Designing and Implementing Algorithms for the Closest String Problem ⋮ Multiple genome rearrangement by swaps and by element duplications ⋮ Sublinear time motif discovery from multiple sequences ⋮ Parameterized complexity analysis for the closest string with wildcards problem ⋮ On the kernelization complexity of string problems ⋮ Efficient solutions for the far from most string problem ⋮ A GRASP algorithm for the closest string problem using a probability-based heuristic ⋮ A heuristic algorithm based on Lagrangian relaxation for the closest string problem ⋮ Consensus String Problem for Multiple Regular Languages ⋮ Unnamed Item ⋮ Listing Center Strings Under the Edit Distance Metric ⋮ On the hardness of maximum rank aggregation problems ⋮ Efficient algorithms for consensus string problems minimizing both distance sum and radius ⋮ Closest substring problems for regular languages ⋮ A set covering based approach to find the reduct of variable precision rough set ⋮ Parameterized Enumeration for Modification Problems ⋮ Consensus string problem for multiple regular languages ⋮ Unnamed Item ⋮ Hybridizations of GRASP with path relinking for the far from most string problem ⋮ Locating-Domination and Identification ⋮ Consensus strings with small maximum distance and small distance sum ⋮ Designing and implementing algorithms for the closest string problem ⋮ Aggregation over Metric Spaces: Proposing and Voting in Elections, Budgeting, and Legislation ⋮ Parameterized resiliency problems ⋮ Randomized fixed-parameter algorithms for the closest string problem ⋮ \(k\)-approximate quasiperiodicity under Hamming and edit distance
Cites Work
This page was built for publication: On covering problems of codes
