arXiv (All)
open access
A Framework for the Design of Efficient Diversification Algorithms for Packing and Covering Problems
There has been considerable recent interest in computing a diverse collection of solutions to a given optimization problem. Given a classical optimization problem $Π$ (e.g., minimum spanning tree, maximum independent set) with input size $n$ and an integer $k\geq 1$, the goal is to generate a collec
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
- Approximation Algorithms for Perfect Fair-Triangle Packing#652430
- Approximation Algorithms for Perfect Fair-Triangle Packing#650977
- Packing Diverse Shortest Cycles#1234196
- Shadoks Approach to Knapsack Polygonal Packing#1189006
- The Budgeted Spanning Tree Problem : Extended formulations, Projection, and Branch-and-Cut#284231
Record · ID 1324460
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