Skew Minimization Problem with Possible Sink Displacement
Explore this paper's citation graph
Summary
Simple necessary conditions for existence of the desired tree, heuristic rules for displacement of the terminals for which these conditions are not satisfied, and a new polynomial algorithm to determine an approximate solution were presented.
- Type
- article
- Published
- 2003-03-01
- Cited by
- 4
- References
- 12
- OpenAlex
- https://openalex.org/W49804194
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:116141142
Keywords
Vertex (graph theory), Heuristic, Tree (set theory), Simple (philosophy), Polynomial
References
- Minimum-cost bounded-skew clock routing
- On rectilinear distance-preserving trees
- Matching-based methods for high-performance clock routing
- A deep-submicron steiner tree
- Polynomial algorithm for min-cost delay-constrained multicasting routing problem in networks
- High-performance clock routing based on recursive geometric matching
- Zero skew clock routing with minimum wirelength
- A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs
- An n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs
- A note on two problems in connexion with graphs
- I Computational Complexity
Cited by
Related papers
- Displacement Measurement of Multi-point Using a Pattern Recognition from Video Signal
- A Way for Overall Analysis on Dam's Displacement
- Not so fast, and not so easy: Essentialism doesn't emerge from a simple heuristic
- Confucian heuristic-teaching method and fostering innovative talents
- Using heuristic worked examples to promote inquiry-based learning
- Development of a Vertex Finding Algorithm using Recurrent Neural Network
- Developing of Micro FBG Displacement Sensor and Its Application to Model Experiment
- On the application of scientific research and heuristic model of teaching in higher education