arXiv (All)
open access
Binary $k$-Center under a Hard Threshold with Applications to Delegated Voting
We study the problem of covering binary strings of the same length, possibly with missing entries, by a fixed number of center strings, such that each input string is within a given relative distance of the closest center. The problem has applications in binary $k$-center clustering and bioinformati
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Minimum enclosing Bregman balls made easy#925214
- Minimum enclosing Bregman balls made easy#920979
- Multi-label feature selection based on binary hashing learning and dynamic graph constraints#153038
- Construction of Kochen-Specker Sets from Mutually Unbiased Bases#635641
- Construction of Kochen-Specker Sets from Mutually Unbiased Bases#633292
Record · ID 1129976
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive