arXiv (All)
open access
A Bregman-Sinkhorn Algorithm for the Maximum Weight Independent Set Problem
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
- A Bregman-Sinkhorn Algorithm for the Maximum Weight Independent Set Problem#668224
- Bounded Independence Edge Subsampling in Graphs#347579
- Opposition-based learning memetic algorithm for the maximum intersection of k-subsets problem#231625
- Exact Algorithms for Network Fortification and Design Problems under Stochastic Interdiction#244652
- An Empirical Analysis of the B-Tree Navigator Algorithm: Solving the Subset Sum Problem in Polynomial-Average Time#28917
Record · ID 670289
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