TL;DR
This paper presents a polynomial-time algorithm for optimal connected edge searching in bounded degree weighted trees, while establishing NP-completeness for the general case with node weights.
Contribution
It introduces a polynomial-time solution for bounded degree trees and proves NP-completeness for the general node-weighted case.
Findings
Polynomial-time algorithm for bounded degree trees
NP-completeness for general node-weighted trees
Optimal search strategies can be efficiently computed in specific cases
Abstract
In this paper we consider the problem of connected edge searching of weighted trees. It is shown that there exists a polynomial-time algorithm for finding optimal connected search strategy for bounded degree trees with arbitrary weights on the edges and vertices of the tree. The problem is NP-complete for general node-weighted trees (the weight of each edge is 1).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.