Pages that link to "Item:Q3428912"
From MaRDI portal
The following pages link to Maximum independent set for intervals by divide and conquer with pruning (Q3428912):
Displaying 5 items.
- One-dimensional \(k\)-center on uncertain data (Q497686) (← links)
- The two-center problem of uncertain points on a real line (Q2687919) (← links)
- New properties of maximum independent set problem solution truncation rules or redundant branches (Q2737186) (← links)
- Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals (Q2980919) (← links)
- Targeted Branching for the Maximum Independent Set Problem (Q6159907) (← links)