An Online Algorithm for the Postman Problem with a Small Penalty.
Piotr BermanJunichiro FukuyamaPublished in: RANDOM-APPROX (2001)
Keyphrases
- learning algorithm
- objective function
- preprocessing
- improved algorithm
- times faster
- significant improvement
- cost function
- np hard
- theoretical analysis
- real time
- computational cost
- dynamic programming
- experimental study
- detection algorithm
- segmentation algorithm
- high accuracy
- experimental evaluation
- active learning
- k means
- computational complexity
- similarity measure
- selection algorithm
- probabilistic model
- recognition algorithm
- memory requirements
- estimation algorithm
- matching algorithm
- ant colony optimization
- particle swarm optimization
- small number
- search space
- data sets