arXiv (All)
open access
Approximation Schemes for k-Subset Sum Ratio and k-way Number Partitioning Ratio
The Subset Sum Ratio problem (SSR) asks, given a multiset $A$ of positive integers, to find two disjoint subsets of $A$ such that the largest-to-smallest ratio of their sums is minimized. In this paper we study the $k$-version of SSR, namely $k$-Subset Sum Ratio ($k$-SSR), which asks to minimize the
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
- Matching with Multiple Bottlenecks: Parameterized Complexity and Approximation#1202530
- Partition Scores Are Not System Scores: Deployment-Fidelity Gaps in Decomposed Algorithm Selection#1083285
- A Framework for the Design of Efficient Diversification Algorithms for Packing and Covering Problems#1324460
- Approximation algorithms via discrepancy with hard constraints#1327669
- Exact Algorithms for Distance to Unique Vertex Cover#1297984
Record · ID 1247261
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