Pages that link to "Item:Q2446858"
From MaRDI portal
The following pages link to Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems (Q2446858):
Displaying 7 items.
- Informative path planning as a maximum traveling salesman problem with submodular rewards (Q2345604) (← links)
- Feedback arc set problem in bipartite tournaments (Q2380064) (← links)
- A randomized approximation algorithm for metric triangle packing (Q5918266) (← links)
- Approximation algorithms for the maximum-weight cycle/path packing problems (Q6542868) (← links)
- Improved approximation algorithms for cycle and path packings (Q6575393) (← links)
- A deterministic approximation algorithm for metric triangle packing (Q6589849) (← links)
- An improved approximation algorithm for metric triangle packing (Q6636067) (← links)
