A faster parameterized algorithm for set packing.
Ioannis KoutisPublished in: Inf. Process. Lett. (2005)
Keyphrases
- packing problem
- preprocessing
- dynamic programming
- improved algorithm
- input data
- np hard
- computationally efficient
- cost function
- experimental evaluation
- probabilistic model
- memory efficient
- search space
- times faster
- high accuracy
- lower and upper bounds
- detection algorithm
- optimization algorithm
- recognition algorithm
- scoring function
- linear programming
- computational complexity
- optimal solution
- computationally demanding
- nearest neighbour
- initial set
- undirected graph
- feature selection
- solution space
- path planning
- matching algorithm
- classification algorithm
- tree structure
- theoretical analysis
- particle swarm optimization
- worst case
- computational cost
- significant improvement