Metraipolis › archive › dc_58733c66587d

Combinatorial Algorithms for Partial Inverse Min-Max Spanning Tree Problem under the Weighted Sum Hamming Distance — arXiv:2611.00094

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.00094
License (as archived)
CC0-1.0
Archived
2026-11-03T18:50:45.879Z
SHA-256 of the archived text
6cda3bca67f26f2c54a49d26f03fbb2cd2a654286e0554875ff07c0599045e42
Stable URL of this page
https://metraipolis.com/documento/dc_58733c66587d

How to cite

Combinatorial Algorithms for Partial Inverse Min-Max Spanning Tree Problem under the Weighted Sum Hamming Distance — arXiv:2611.00094 — arXiv (en), https://arxiv.org/abs/2611.00094 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_58733c66587d (Metraipolis archive dc_58733c66587d, sha256 6cda3bca67f26f2c54a49d26f03fbb2cd2a654286e0554875ff07c0599045e42)
BibTeX
@misc{dc58733c66587d,
  title = {Combinatorial Algorithms for Partial Inverse Min-Max Spanning Tree Problem under the Weighted Sum Hamming Distance — arXiv:2611.00094},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.00094},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_58733c66587d; sha256 6cda3bca67f26f2c54a49d26f03fbb2cd2a654286e0554875ff07c0599045e42},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.00094. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Given a connected weighted graph G=(V, E, w) and a forest F of G, the goal of partial inverse min-max spanning tree problem is to change the weight function as little as possible, so that there is a min-max spanning tree with respect to the new weight function containing F. In this paper, we study this problem under the weighted sum Hamming distance. We take the alternative set of the maximum edge weight in F with respect to the optimal weight function as a key factor, and further consider the case of this problem under the restriction of this factor. On this basis, a polynomial time algorithm with time complexity O(|V|^4) is proposed to solve this problem.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.00094 — 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-11-03T18:15:38.110Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).