An Improved Branching Algorithm for Two-Layer Planarization Parameterized by the Feedback Edge Set Number.
Mathias WellerPublished in: SEA (2013)
Keyphrases
- small number
- initial set
- computational complexity
- polynomial time complexity
- times faster
- search space
- memory requirements
- optimization algorithm
- average distance
- reduced set
- undirected graph
- computational cost
- learning algorithm
- representative set
- dynamic programming
- cost function
- randomly sampled
- matching algorithm
- randomized algorithm
- space complexity
- decomposition algorithm
- convex hull
- single scan
- minimal length
- clustering algorithm
- detection algorithm
- k means
- segmentation algorithm
- solution space
- np hard
- input data
- input pattern
- optimal solution
- evolutionary algorithm
- edge detection algorithm
- expectation maximization
- np complete
- minimum distance
- cluster centers
- maximum number
- branch and bound