Heuristically guided algorithm for k-parity matroid problems.
Paolo M. CameriniFrancesco MaffioliPublished in: Discret. Math. (1978)
Keyphrases
- learning algorithm
- computational complexity
- dynamic programming
- experimental evaluation
- greedy algorithms
- test problems
- benchmark problems
- combinatorial optimization
- times faster
- simulated annealing
- theoretical analysis
- matching algorithm
- detection algorithm
- high accuracy
- computational cost
- np hard
- optimal solution
- cost function
- worst case
- k means
- theoretical guarantees
- iterative algorithms
- objective function
- recognition algorithm
- significant improvement
- tree structure
- optimization algorithm
- convex hull
- segmentation algorithm
- data sets
- computational geometry
- input data
- similarity measure
- optimal or near optimal