scientific article; zbMATH DE number 7525465
From MaRDI portal
Publication:5075765
DOI10.4230/LIPIcs.ESA.2019.28MaRDI QIDQ5075765
Manuel Sorge, Jiehua Chen, Danny Hermelin
Publication date: 11 May 2022
Full work available at URL: https://arxiv.org/abs/1807.06469
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
On the parameterized complexity of clustering problems for incomplete data ⋮ Consensus strings with small maximum distance and small distance sum ⋮ The Fréchet mean of inhomogeneous random graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A three-string approach to the closest string problem
- On covering problems of codes
- Fixed-parameter algorithms for CLOSEST STRING and related problems
- Distinguishing string selection problems.
- On the parameterized complexity of consensus clustering
- A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints
- Approval Balloting for Multi-winner Elections
- More Efficient Algorithms for Closest String and Substring Problems
- Parametric Facility Location on a Tree Network with an Lp-Norm Cost Function
- The linear regression model: Lpnorm estimation and the choice of p
- Optimal Locations for a Class of Nonlinear, Single-Facility Location Problems on a Network
- All-norm approximation algorithms
- Bypassing UGC from Some Optimal Geometric Inapproximability Results
- How hard is it to satisfy (almost) all roommates
- Lower Bounds for Approximation Schemes for Closest String
- Parameterized Algorithms
- Introduction to Coding Theory
This page was built for publication:
