Efficient Heuristics for the Minimum Shortest Path Steiner Arborescence Problem With Applications to VLSI Physical Design

doi 10.1145/267665.267695
Full Text
Abstract

Available in full text

Date
Authors
Publisher

ACM Press

Related search

Efficient Algorithms for the Minimum Shortest Path Steiner Arborescence Problem With Applications to VLSI Physical Design

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
ElectricalSoftwareComputer GraphicsComputer-Aided DesignElectronic Engineering
1998English

Embedding Graphs in Books: A Layout Problem With Applications to VLSI Design

SIAM Journal on Algebraic Discrete Methods
1987English

The Shortest Path Problem for a Multiple Graph

Modeling and Analysis of Information Systems
2017English

Two Variations of the Minimum Steiner Problem

Journal of Combinatorial Optimization
ControlOptimizationCombinatoricsApplied MathematicsDiscrete MathematicsComputer Science ApplicationsMathematicsComputational Theory
2005English

The Minimum Equivalent DNF Problem and Shortest Implicants

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
2001English

Vlsi Design of Efficient Encoding Technique Using Rols Method for Wave Applications

International Journal of Research in Engineering and Technology
2015English

The Minimum Steiner Tree Problem Based on Genetic Algorithm

DEStech Transactions on Computer Science and Engineering
2018English

Parallel Minimum Spanning Tree Heuristic for the Steiner Problem in Graphs

2007English

Subcubic Cost Algorithms for the All Pairs Shortest Path Problem

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
1998English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy