An optimal algorithm for maximum two planar subset problem [VLSI layout].
Anand PanyamSrinivasa R. DandaSreekrishna MadhwapathyNaveed A. SherwaniPublished in: Great Lakes Symposium on VLSI (1994)
Keyphrases
- dynamic programming
- worst case
- experimental evaluation
- learning algorithm
- times faster
- recognition algorithm
- detection algorithm
- optimal solution
- k means
- cost function
- clustering method
- optimization algorithm
- computationally efficient
- significant improvement
- matching algorithm
- particle swarm optimization
- linear programming
- computational cost
- computational complexity
- planar graphs
- np hard
- globally optimal
- initial set
- weighting coefficients
- closed form
- segmentation algorithm
- multi objective
- association rules
- objective function