Worst-Case Minimum Rectilinear Steiner Trees in All Dimensions

Discrete and Computational Geometry - United States
doi 10.1007/bf02293036
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Nature

Related search

Computing Optimal Rectilinear Steiner Trees: A Survey and Experimental Evaluation

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
1999English

The Rectilinear Steiner Ratio

ORiON
2005English

A Fast Algorithm for Computing Optimal Rectilinear Steiner Trees for Extremal Point Sets

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1995English

Obstacle-Avoiding Rectilinear Steiner Tree Construction

2008English

Fixed-Parameter Algorithms for Rectilinear Steiner Tree and Rectilinear Traveling Salesman Problem in the Plane

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2018English

Rectilinear Block Placement Using B*-Trees

ACM Transactions on Design Automation of Electronic Systems
Computer Science ApplicationsElectronic EngineeringComputer GraphicsElectricalComputer-Aided Design
2003English

Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity

2020English

Two Variations of the Minimum Steiner Problem

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

Vertices Belonging to All or to No Minimum Locating Dominating Sets of Trees

Opuscula Mathematica
Mathematics
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy