arXiv (All)
open access
Hardness and Approximation Algorithms for Balanced Districting Problems
We introduce and study the problem of balanced districting, where given an undirected graph with vertices carrying two types of weights (different population, resource types, etc) the goal is to maximize the total weights covered in vertex disjoint districts such that each district is a star or (in
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
- GraphIFE: Rethinking Graph Imbalance Node Classification via Invariant Learning#1122951
- Learning for Graph Matching and Related Combinatorial Optimization Problems#478214
- Matching Complexes of Outerplanar Graphs#1063729
- Fractional Triangle Decompositions at Partite Minimum Degree $4n/5$#1115714
- An Arboricity-Sensitive Algorithm for the $K_r-e$-Free Graph Sandwich Problem#1049199
Record · ID 1011993
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