Pages that link to "Item:Q6488359"
From MaRDI portal
The following pages link to Max-Min Problems of Searching for Two Disjoint Subsets (Q6488359):
Displaying 6 items.
- A 2-approximate algorithm to solve one problem of the family of disjoint vector subsets (Q463361) (← links)
- NP-hardness of some max-min clustering problems (Q2026156) (← links)
- Extracting constrained 2-interval subsets in 2-interval sets (Q2456375) (← links)
- (Q3024804) (← links)
- Maximizing the Number of Nonnegative Subsets (Q3192165) (← links)
- (Q4939984) (← links)