A Polynomial-time Algorithm for the Bistable Roommates Problem.
Jay SethuramanChung-Piaw TeoPublished in: J. Comput. Syst. Sci. (2001)
Keyphrases
- learning algorithm
- computational complexity
- worst case
- experimental evaluation
- objective function
- optimal solution
- preprocessing
- linear programming
- improved algorithm
- theoretical analysis
- optimization algorithm
- dynamic programming
- segmentation algorithm
- computational cost
- np hard
- special case
- convergence rate
- classification algorithm
- recognition algorithm
- similarity measure
- graph cuts
- expectation maximization
- times faster
- convex hull
- multi objective
- search space
- search algorithm
- approximation ratio
- causal graph
- randomized algorithm
- min cost