Designing small keyboards is hard

DOI10.1016/j.tcs.2004.12.004zbMath1070.68154OpenAlexW4210521544MaRDI QIDQ1770399

Stefan Langerman, Jean Cardinal

Publication date: 6 April 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.12.004

zbMATH Keywords

Combinatorial optimizationNP-hardnessApproximation algorithms

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (1)

The single-finger keyboard layout problem

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Free Bits, PCPs, and Nonapproximability---Towards Tight Results

This page was built for publication: Designing small keyboards is hard