Pages that link to "Item:Q3865869"
From MaRDI portal
The following pages link to The greedy travelling salesman's problem (Q3865869):
Displaying 5 items.
- The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings (Q313766) (← links)
- Recognition of overlap graphs (Q405660) (← links)
- A greedy approximation algorithm for constructing shortest common superstrings (Q1102756) (← links)
- Informative path planning as a maximum traveling salesman problem with submodular rewards (Q2345604) (← links)
- Robust Independence Systems (Q5892606) (← links)
