On the public citation graph

A Faster Algorithm for the Steiner Tree Problem

0 signed · 82 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.3230010302openalex-snapshot
The steiner problem in graphs
inferredcites →https://doi.org/10.1007/11523468_16openalex-snapshot
Measure and Conquer: Domination – A Case Study
inferredcites →https://doi.org/10.1007/11604686_34openalex-snapshot
Algorithms Based on the Treewidth of Sparse Graphs
inferredcites →https://doi.org/10.1007/3-540-19422-3_17openalex-snapshot
On integration mechanisms within a graph-based software development environment
inferredcites →https://doi.org/10.1007/3-540-57209-0_8openalex-snapshot
Requirements engineering: An integrated view of representation, process, and domain
inferredcites →https://doi.org/10.1007/3-540-58183-9_66openalex-snapshot
Intelligent networks as a data intensive application (INDIA)
inferredcites →https://doi.org/10.1007/978-3-322-80291-0openalex-snapshot
The Steiner Tree Problem: A Tour through Graphs, Algorithms, and Complexity
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_101openalex-snapshot
A New Algorithm for Optimal Constraint Satisfaction and Its Implications
inferredcites →https://doi.org/10.1007/978-3-540-45198-3_32openalex-snapshot
Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances
inferredcites →https://doi.org/10.1007/bfb0029017openalex-snapshot
Amore: A system for computing automata, MOnoids, and regular expressions
inferredcites →https://doi.org/10.1007/s10958-005-0101-7openalex-snapshot
A 2|E|/4-time algorithm for MAX-CUT
inferredcites →https://doi.org/10.1016/0020-0190(89)90039-2openalex-snapshot
The Steiner problem with edge lengths 1 and 2
inferredcites →https://doi.org/10.1016/0167-8191(89)90128-2openalex-snapshot
Specifying distributed computer architectures in AADL
inferredcites →https://doi.org/10.1016/0196-6774(86)90032-5openalex-snapshot
Algorithms for maximum independent sets
inferredcites →https://doi.org/10.1016/0306-4573(94)90023-xopenalex-snapshot
On inference rules of logic-based information retrieval systems
inferredcites →https://doi.org/10.1016/b978-0-444-81584-2.50035-5openalex-snapshot
TIMER HANDLING IN HIGH-PERFORMANCE TRANSPORT SYSTEMS
inferredcites →https://doi.org/10.1016/j.tcs.2005.09.023openalex-snapshot
A new algorithm for optimal 2-constraint satisfaction and its implications
inferredcites →https://doi.org/10.1016/s1474-6670(17)53673-3openalex-snapshot
Integrated Project Team Management in a Software Development Environment
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/26.380130openalex-snapshot
Analyzing routing strategy NFP in multihop packet radio networks on a line
inferredcites →https://doi.org/10.1109/49.1961openalex-snapshot
File transfer in high-speed token ring networks: performance evaluation by approximate analysis and simulation
inferredcites →https://doi.org/10.1109/eurcon.1988.11155openalex-snapshot
Satellite communication protocols-a performance comparison considering on-board processing
inferredcites →https://doi.org/10.1109/icc.1989.49719openalex-snapshot
OSI-an appropriate basis for group communication?
inferredcites →https://doi.org/10.1109/icnn.1994.375000openalex-snapshot
k-coloring vertices using a neural network with convergence to valid solutions
inferredcites →https://doi.org/10.1109/vetec.1992.245474openalex-snapshot
Analyzing a distributed slot assignment protocol by Markov chains
inferredcites →https://doi.org/10.1145/224019.224041openalex-snapshot
Business process oriented information management
inferredcites →https://doi.org/10.5555/338219.338638openalex-snapshot
Improved Steiner tree approximation in graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/net.21825openalex-snapshot
Algorithms for node‐weighted Steiner tree and maximum‐weight connected subgraph
inferred← citeshttps://doi.org/10.1007/11753728_28openalex-snapshot
Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover
inferred← citeshttps://doi.org/10.1007/11809678_29openalex-snapshot
Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants
inferred← citeshttps://doi.org/10.1007/11889205_2openalex-snapshot
Algorithms and Constraint Programming
inferred← citeshttps://doi.org/10.1007/11940128_60openalex-snapshot
Intuitive Algorithms and t-Vertex Cover
inferred← citeshttps://doi.org/10.1007/11944836_16openalex-snapshot
Solving Connected Dominating Set Faster Than 2 n
inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_19openalex-snapshot
Quantum Speedup for the Minimum Steiner Tree Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-77566-9_5openalex-snapshot
On the Hardness of Reoptimization
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_36openalex-snapshot
Faster Steiner Tree Computation in Polynomial-Space
inferred← citeshttps://doi.org/10.1007/s00224-007-1309-3openalex-snapshot
Parameterized Complexity of Vertex Cover Variants
inferred← citeshttps://doi.org/10.1007/s00224-007-1324-4openalex-snapshot
Dynamic Programming for Minimum Steiner Trees
inferred← citeshttps://doi.org/10.1007/s00224-007-1334-2openalex-snapshot
Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques
inferred← citeshttps://doi.org/10.1007/s00224-007-9089-3openalex-snapshot
Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover
inferred← citeshttps://doi.org/10.1007/s00453-007-9145-zopenalex-snapshot
Solving Connected Dominating Set Faster than 2 n
inferred← citeshttps://doi.org/10.1007/s00453-012-9612-zopenalex-snapshot
Computing Optimal Steiner Trees in Polynomial Space
inferred← citeshttps://doi.org/10.1007/s10479-014-1607-5openalex-snapshot
Algorithmic aspects of Steiner convexity and enumeration of Steiner trees
inferred← citeshttps://doi.org/10.1007/s11424-014-2120-2openalex-snapshot
Definition and algorithms for reliable steiner tree problem
inferred← citeshttps://doi.org/10.1007/s13218-010-0015-5openalex-snapshot
Static Termination Analysis for Prolog Using Term Rewriting and SAT Solving
inferred← citeshttps://doi.org/10.1007/s13740-012-0001-1openalex-snapshot
On Modeling and Querying Concept Evolution
inferred← citeshttps://doi.org/10.1016/j.disc.2010.09.024openalex-snapshot
Splitting trees at vertices
inferred← citeshttps://doi.org/10.1016/j.endm.2009.11.053openalex-snapshot
Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals
inferred← citeshttps://doi.org/10.1016/j.ins.2007.01.014openalex-snapshot
A factoring approach for the Steiner tree problem in undirected networks
inferred← citeshttps://doi.org/10.1016/j.jda.2008.09.007openalex-snapshot
Vertex and edge covers with clustering properties: Complexity and algorithms
inferred← citeshttps://doi.org/10.1016/j.jda.2013.06.011openalex-snapshot
Exponential approximation schemata for some network design problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.04.039openalex-snapshot
Reoptimization of Steiner trees: Changing the terminal set
inferred← citeshttps://doi.org/10.1080/02331934.2012.704515openalex-snapshot
Moderately exponential time and fixed parameter approximation algorithms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.001.0001openalex-snapshot
Invitation to Fixed-Parameter Algorithms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.002.0004openalex-snapshot
Copyright Page
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.002.0005openalex-snapshot
PREFACE
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0001openalex-snapshot
INTRODUCTION TO FIXED-PARAMETER ALGORITHMS
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0002openalex-snapshot
PRELIMINARIES AND AGREEMENTS
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0003openalex-snapshot
PARAMETERIZED COMPLEXITY THEORY—A PRIMER
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0004openalex-snapshot
VERTEX COVER—AN ILLUSTRATIVE EXAMPLE
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0005openalex-snapshot
THE ART OF PROBLEM PARAMETERIZATION
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0006openalex-snapshot
SUMMARY AND CONCLUDING REMARKS
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0007openalex-snapshot
DATA REDUCTION AND PROBLEM KERNELS
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0008openalex-snapshot
DEPTH-BOUNDED SEARCH TREES
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0009openalex-snapshot
DYNAMIC PROGRAMMING
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0010openalex-snapshot
TREE DECOMPOSITIONS OF GRAPHS
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0011openalex-snapshot
FURTHER ADVANCED TECHNIQUES
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0012openalex-snapshot
SUMMARY AND CONCLUDING REMARKS
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0013openalex-snapshot
PARAMETERIZED COMPLEXITY THEORY
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0014openalex-snapshot
CONNECTIONS TO APPROXIMATION ALGORITHMS
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0015openalex-snapshot
SELECTED CASE STUDIES
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.003.0016openalex-snapshot
ZUKUNFTSMUSIK
inferred← citeshttps://doi.org/10.1109/cc.2015.7224698openalex-snapshot
Steiner tree based optimal resource caching scheme in fog computing
inferred← citeshttps://doi.org/10.1145/1250790.1250801openalex-snapshot
Fourier meets möbius: fast subset convolution
inferred← citeshttps://doi.org/10.1145/1806689.1806769openalex-snapshot
An improved LP-based approximation for steiner tree
inferred← citeshttps://doi.org/10.1145/2432622.2432628openalex-snapshot
Steiner Tree Approximation via Iterative Randomized Rounding
inferred← citeshttps://doi.org/10.1145/3139958.3139972openalex-snapshot
Ride-sharing is About Agreeing on a Destination
inferred← citeshttps://doi.org/10.1145/3317639openalex-snapshot
Congestion-Aware Ride-Sharing
inferred← citeshttps://doi.org/10.1587/transcom.e97.b.996openalex-snapshot
An Artificial Fish Swarm Algorithm for the Multicast Routing Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1409.6578openalex-snapshot
MontiArc - Architectural Modeling of Interactive Distributed and Cyber-Physical Systems
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0611101openalex-snapshot
Fourier meets Möbius: fast subset convolution
inferred← citeshttps://doi.org/10.70675/3132197ezbf73z4ad9zb29fz20b8a8e35a63openalex-snapshot
Parallelisation of hybrid metaheuristics for COP solving
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.