arXiv (All)
open access
On the maximum weight convex problem for some geometric graph-convexities
For a given geometric graph-convexity on a graph $G$ equipped with a weight function on the vertices with value in $\mathbb{Z}$, the Max Weight Convex Set problem consists in determining the convex set $S$ with maximum weight (sum of the weight of the vertices in $S$). Although the problem is NP-com
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
- On the maximum weight convex problem for some geometric graph-convexities#808790
- An infeasible interior-point algorithm for solving primal and dual geometric programs#429971
- The Full P-vertex Problem and Perfect Matchings for Bipartite Graphs#987518
- A new O(n log n) approach for the Euclidean maximum weight matching problem#998419
- Inverse knapsack at two capacities: which pairs of value-cardinality hulls are realizable?#1064672
Record · ID 818782
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