On the public citation graph

RNC-approximation algorithms for the steiner problem

0 signed · 64 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.1006/jagm.1994.1041openalex-snapshot

Improved Approximations for the Steiner Tree Problem

inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot

Reducibility among Combinatorial Problems

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-68279-0_8openalex-snapshot

Reducibility Among Combinatorial Problems

inferredcites →https://doi.org/10.1007/bf00288961openalex-snapshot

A fast algorithm for Steiner trees

inferredcites →https://doi.org/10.1007/bf01187035openalex-snapshot

An 11/6-approximation algorithm for the network steiner problem

inferredcites →https://doi.org/10.1007/bf02579169openalex-snapshot

An augmenting path algorithm for linear matroid parity

inferredcites →https://doi.org/10.1007/bf02579206openalex-snapshot

Matching is as easy as matrix inversion

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/0020-0190(93)90019-6openalex-snapshot

An O(log m) parallel algorithm for the minimum spanning tree problem

inferredcites →https://doi.org/10.1016/0196-6774(92)90018-8openalex-snapshot

Random pseudo-polynomial algorithms for exact matroid problems

inferredcites →https://doi.org/10.1016/s0747-7171(08)80013-2openalex-snapshot

Matrix multiplication via arithmetic progressions

inferredcites →https://doi.org/10.1023/a:1009758919736openalex-snapshot

New Approximation Algorithms for the Steiner Tree Problems

inferredcites →https://doi.org/10.1051/ro/1978120202071openalex-snapshot

Une heuristique pour le problème de l'arbre de Steiner

inferredcites →https://doi.org/10.1109/sfcs.1984.715935openalex-snapshot

Efficient Implementation Of Graph Algorithms Using Contraction

inferredcites →https://doi.org/10.1109/sfcs.1991.185402openalex-snapshot

On better heuristic for Euclidean Steiner minimum trees

inferredcites →https://doi.org/10.1109/sfcs.1992.267823openalex-snapshot

Proof verification and hardness of approximation problems

inferredcites →https://doi.org/10.1145/225058.225282openalex-snapshot

The k-Steiner ratio in graphs

inferredcites →https://doi.org/10.1145/28395.28396openalex-snapshot

Matrix multiplication via arithmetic progressions

inferredcites →https://doi.org/10.1145/28395.383347openalex-snapshot

Matching is as easy as matrix inversion

inferredcites →https://doi.org/10.18130/v3w75popenalex-snapshot

Better approximation bounds for the network and Euclidean Steiner tree problems

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11940128_16openalex-snapshot

Algorithms on Graphs with Small Dominating Targets

inferred← citeshttps://doi.org/10.1007/3-540-45878-6_7openalex-snapshot

Primal-Dual Schema Based Approximation Algorithms

inferred← citeshttps://doi.org/10.1007/978-1-4757-3171-2_10openalex-snapshot

Preprocessing the Steiner Problem in Graphs

inferred← citeshttps://doi.org/10.1007/978-3-030-41672-0_15openalex-snapshot

An Efficient Approximation Algorithm for the Steiner Tree Problem

inferred← citeshttps://doi.org/10.1007/978-3-319-13915-9_5openalex-snapshot

Steiner Trees in Graphs and Hypergraphs

inferred← citeshttps://doi.org/10.1007/978-3-319-14896-0_6openalex-snapshot

Steiner Tree 1.39-Approximation in Practice

inferred← citeshttps://doi.org/10.1007/978-3-540-69733-6_61openalex-snapshot

Approximating the Generalized Capacitated Tree-Routing Problem

inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_25openalex-snapshot

Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on Epsilon

inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_6openalex-snapshot

Contraction-Based Steiner Tree Approximations in Practice

inferred← citeshttps://doi.org/10.1007/978-3-642-32512-0_3openalex-snapshot

Additive Approximation for Near-Perfect Phylogeny Construction

inferred← citeshttps://doi.org/10.1007/978-981-97-0566-5_6openalex-snapshot

Fully Dynamic Algorithms for Euclidean Steiner Tree

inferred← citeshttps://doi.org/10.1007/s00453-003-1069-7openalex-snapshot

Approximation Algorithms for a Capacitated Network Design Problem

inferred← citeshttps://doi.org/10.1007/s10732-007-9015-5openalex-snapshot

Automated antenna positioning algorithms for wireless fixed-access networks

inferred← citeshttps://doi.org/10.1007/s11424-014-2120-2openalex-snapshot

Definition and algorithms for reliable steiner tree problem

inferred← citeshttps://doi.org/10.1016/j.adhoc.2006.04.004openalex-snapshot

Spanning tree based algorithms for low latency and energy efficient data aggregation enhanced convergecast (DAC) in wireless sensor networks

inferred← citeshttps://doi.org/10.1016/j.jcss.2021.07.003openalex-snapshot

An improved algorithm for the Steiner tree problem with bounded edge-length

inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00192-9openalex-snapshot

Recent results on approximating the Steiner tree problem and its generalizations

inferred← citeshttps://doi.org/10.1109/43.875292openalex-snapshot

A new heuristic for rectilinear Steiner trees

inferred← citeshttps://doi.org/10.1109/focs.2009.39openalex-snapshot

Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP

inferred← citeshttps://doi.org/10.1109/iccad.1999.810641openalex-snapshot

A new heuristic for rectilinear Steiner trees

inferred← citeshttps://doi.org/10.1109/smartworld.2018.00048openalex-snapshot

Multicast Tree Generation Technique Using Reinforcement Learning in SDN Environments

inferred← citeshttps://doi.org/10.1137/1.9781611973082.105openalex-snapshot

Algebraic Algorithms for Linear Matroid Parity Problems

inferred← citeshttps://doi.org/10.1137/s0895480101393155openalex-snapshot

Tighter Bounds for Graph Steiner Tree Approximation

inferred← citeshttps://doi.org/10.1137/s0895480199352622openalex-snapshot

Minimizing Wirelength in Zero and Bounded Skew Clock Trees

inferred← citeshttps://doi.org/10.1145/1541885.1541892openalex-snapshot

An O ( n log n ) approximation scheme for Steiner tree in planar graphs

inferred← citeshttps://doi.org/10.1145/1806689.1806720openalex-snapshot

Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth

inferred← citeshttps://doi.org/10.1145/2027216.2027219openalex-snapshot

Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth

inferred← citeshttps://doi.org/10.1145/2601066openalex-snapshot

Algebraic Algorithms for Linear Matroid Parity Problems

inferred← citeshttps://doi.org/10.1145/2897518.2897549openalex-snapshot

A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting

inferred← citeshttps://doi.org/10.1145/3299903openalex-snapshot

Strong Steiner Tree Approximations in Practice

inferred← citeshttps://doi.org/10.1145/3322645.3322649openalex-snapshot

An Efficient Approximation Algorithm for the Steiner Tree Problem

inferred← citeshttps://doi.org/10.1145/370155.370304openalex-snapshot

New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout

inferred← citeshttps://doi.org/10.1162/evco_a_00200openalex-snapshot

Performance Analysis of Evolutionary Algorithms for Steiner Tree Problems

inferred← citeshttps://doi.org/10.1184/r1/6703847openalex-snapshot

Approximation Algorithms for a Capacitated Network Design Problem

inferred← citeshttps://doi.org/10.1201/9781420013481-24openalex-snapshot

Minimum Steiner Tree Construction *

inferred← citeshttps://doi.org/10.14778/3461535.3461536openalex-snapshot

Minimum vertex augmentation

inferred← citeshttps://doi.org/10.2139/ssrn.3199234openalex-snapshot

Learning the Semantics of Structured Data Sources

inferred← citeshttps://doi.org/10.2514/6.2010-9073openalex-snapshot

Systems Architecture Design - A Software Development for the JTI Clean Sky Green Regional Aircraft Program

inferred← citeshttps://doi.org/10.3837/tiis.2021.09.003openalex-snapshot

Multicast Tree Generation using Meta Reinforcement Learning in SDN-based Smart Network Platforms

inferred← citeshttps://doi.org/10.48550/arxiv.1310.2494openalex-snapshot

Algorithmes auto-stabilisants pour la construction d'arbres couvrants et la gestion d'entités autonomes

inferred← citeshttps://doi.org/10.48550/arxiv.1709.03867openalex-snapshot

An Efficient Approximation Algorithm for the Steiner Tree Problem

inferred← citeshttps://doi.org/10.5555/338219.338638openalex-snapshot

Improved Steiner tree approximation in graphs

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.