A simple algorithm that proves half-integrality of bidirected network programming.
Ethan D. BolkerThomas ZaslavskyPublished in: Networks (2006)
Keyphrases
- experimental evaluation
- optimization algorithm
- improved algorithm
- times faster
- significant improvement
- high accuracy
- worst case
- objective function
- theoretical analysis
- computationally efficient
- learning algorithm
- detection algorithm
- particle swarm optimization
- linear programming
- computational cost
- np hard
- cost function
- k means
- recognition algorithm
- path planning
- spanning tree
- neural network
- growing neural gas
- tree structure
- expectation maximization
- simulated annealing
- mobile robot
- dynamic programming
- preprocessing
- search algorithm