widest path problem
problem of maximizing the weight of the minimum-weight edge in the path between two vertices
problem of maximizing the weight of the minimum-weight edge in the path between two vertices
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).