Separator-Based Pruned Dynamic Programming for Steiner Tree

Proceedings of the AAAI Conference on Artificial Intelligence
doi 10.1609/aaai.v33i01.33011520
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Association for the Advancement of Artificial Intelligence (AAAI)

Related search

Scalable Parallel Algorithms for Dynamic Programming on Tree Decomposition

English

Efficient Steiner Tree Construction Based on Spanning Graphs

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

Steiner Tree Based Distributed Multicast Routing in Networks

Steiner Trees in Industry
2001English

Improvement of Steiner Tree Algorithm: Branch-Based Multi-Cast

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2013English

The Minimum Steiner Tree Problem Based on Genetic Algorithm

DEStech Transactions on Computer Science and Engineering
2018English

New Pruning Rules for the Steiner Tree Problem and 2-Connected Steiner Network Problem

Computational Geometry: Theory and Applications
ControlOptimizationGeometryComputational TheoryComputer Science ApplicationsComputational MathematicsMathematicsTopology
2019English

Steiner Minimal Tree for Points on a Circle

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1985English

A Steiner Tree-Based Method for Biomarker Discovery and Classification in Breast Cancer Metastasis

BMC Genomics
BiotechnologyGenetics
2012English

Obstacle-Avoiding Rectilinear Steiner Tree Construction

2008English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy