Metraipolis › archive › dc_4458acbc63e8
On the maximum weight convex problem for some geometric graph-convexities — arXiv:2608.30728
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.30728
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T10:07:15.942Z
- SHA-256 of the archived text
2b4c7b88e93d88b303e189bd716afd619608137beafff4c258f3ddc34faf57d5- Stable URL of this page
https://metraipolis.com/documento/dc_4458acbc63e8
How to cite
On the maximum weight convex problem for some geometric graph-convexities — arXiv:2608.30728 — arXiv (en), https://arxiv.org/abs/2608.30728 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4458acbc63e8 (Metraipolis archive dc_4458acbc63e8, sha256 2b4c7b88e93d88b303e189bd716afd619608137beafff4c258f3ddc34faf57d5)
BibTeX
@misc{dc4458acbc63e8,
title = {On the maximum weight convex problem for some geometric graph-convexities — arXiv:2608.30728},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.30728},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4458acbc63e8; sha256 2b4c7b88e93d88b303e189bd716afd619608137beafff4c258f3ddc34faf57d5},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.30728. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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-complete in general, it remains polynomial for particular cases. After a survey of known results, our main contribution uses a generalisation of the maximum subsequence problem to laminar trees. Then we derive a linear algorithm for proper interval graphs and a quadratic one for interval graphs. Both improve the state of the art.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-01 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2608.30728 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T10:00:01.293Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).