The following pages link to Algorithms – ESA 2004 (Q5464633):
Displaying 11 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)
- Stop location design in public transportation networks: covering and accessibility objectives (Q845574) (← links)
- Exact algorithms and applications for tree-like Weighted Set Cover (Q866547) (← links)
- Approximation and fixed-parameter algorithms for consecutive ones submatrix problems (Q972381) (← links)
- Red-blue covering problems and the consecutive ones property (Q1018089) (← links)
- Set covering with almost consecutive ones property (Q2386204) (← links)
- Tree decompositions of graphs: saving memory in dynamic programming (Q2465936) (← links)
- Station location -- complexity and approximation (Q2917411) (← links)
- A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row (Q3007640) (← links)
- (Q5009574) (← links)
