A combinatorial polynomial algorithm for the linear Arrow-Debreu market.
Ran DuanKurt MehlhornPublished in: Inf. Comput. (2015)
Keyphrases
- times faster
- preprocessing
- closed form
- np hard
- learning algorithm
- computational complexity
- optimization algorithm
- experimental evaluation
- polynomially bounded
- recognition algorithm
- cost function
- k means
- expectation maximization
- similarity measure
- search space
- detection algorithm
- ant colony optimization
- objective function
- matching algorithm
- optimal solution
- data sets
- integer arithmetic
- transfer function
- piecewise linear
- classification algorithm
- segmentation algorithm
- worst case
- probabilistic model
- computational cost
- significant improvement