Pages that link to "Item:Q2917411"
From MaRDI portal
The following pages link to Station location -- complexity and approximation (Q2917411):
Displaying 12 items.
- Benders decomposition for set covering problems. Almost satisfying the consecutive ones property (Q512865) (← links)
- A faster algorithm for finding minimum Tucker submatrices (Q693064) (← links)
- Approximation and fixed-parameter algorithms for consecutive ones submatrix problems (Q972381) (← links)
- Red-blue covering problems and the consecutive ones property (Q1018089) (← links)
- Station assignment with applications to sensing (Q1796433) (← links)
- Set covering with almost consecutive ones property (Q2386204) (← links)
- The parameterized complexity of stabbing rectangles (Q2428672) (← links)
- The station location problem on two intersecting lines (Q2847386) (← links)
- The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants (Q3507345) (← links)
- Parameterized Complexity of Stabbing Rectangles and Squares in the Plane (Q3605506) (← links)
- (Q5299610) (← links)
- Algorithms – ESA 2004 (Q5464633) (← links)