Approximation and fixed-parameter algorithms for consecutive ones submatrix problems.
Michael DomJiong GuoRolf NiedermeierPublished in: J. Comput. Syst. Sci. (2010)
Keyphrases
- optimization problems
- combinatorial optimization
- approximation schemes
- related problems
- times faster
- run times
- data structure
- computationally efficient
- practical problems
- benchmark problems
- np hard problems
- error bounds
- specific problems
- problems in computer vision
- difficult problems
- graph theory
- theoretical guarantees
- computational problems
- orders of magnitude
- benchmark datasets
- convex optimization problems
- exact algorithms
- convergence rate
- hard problems
- test problems
- data mining
- search methods
- metaheuristic
- machine learning algorithms
- computational cost
- special case
- search space
- genetic algorithm