On the public citation graph
Worst-Case Analysis of Network Design Problem Heuristics
0 signed · 101 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.1975.5.1.45openalex-snapshot
On the Computational Complexity of Combinatorial Problems
inferredcites →https://doi.org/10.1002/net.3230080402openalex-snapshot
The complexity of the network design 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-030-41732-1_5openalex-snapshot
Algorithms and Complexity
inferredcites →https://doi.org/10.1016/0041-1647(69)90152-xopenalex-snapshot
The optimal network problem: Some computational procedures
inferredcites →https://doi.org/10.1068/a050519openalex-snapshot
Optimal Network Problem: A Branch-and-Bound Algorithm
inferredcites →https://doi.org/10.1145/321921.321926openalex-snapshot
The Complexity of Near-Optimal Graph Coloring
inferredcites →https://doi.org/10.1145/321958.321975openalex-snapshot
P-Complete Approximation Problems
inferredcites →https://doi.org/10.1287/mnsc.19.5.488openalex-snapshot
A Computational Approach to the Selection of an Optimal Network
inferredcites →https://doi.org/10.1287/mnsc.23.8.789openalex-snapshot
Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
inferredcites →https://doi.org/10.1287/moor.2.3.209openalex-snapshot
Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
inferredcites →https://doi.org/10.1287/trsc.9.3.183openalex-snapshot
An Algorithm for the Discrete Network Design Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118600283.ch9openalex-snapshot
Network Design Problems: Fundamental Methods
inferred← citeshttps://doi.org/10.1002/9781119005384.ch9openalex-snapshot
Network Design Problems: Fundamental Methods
inferred← citeshttps://doi.org/10.1002/atr.5670210104openalex-snapshot
Heuristic ranking and selection procedures for network design problems
inferred← citeshttps://doi.org/10.1002/cpe.70019openalex-snapshot
On Reducing Stretch in Spanning Trees
inferred← citeshttps://doi.org/10.1002/net.10019openalex-snapshot
Light graphs with small routing cost
inferred← citeshttps://doi.org/10.1002/net.10022openalex-snapshot
Exact algorithms for minimum routing cost trees
inferred← citeshttps://doi.org/10.1002/net.3230150306openalex-snapshot
Probabilistic analysis of a network design problem heuristic
inferred← citeshttps://doi.org/10.1002/net.3230190305openalex-snapshot
Networks synthesis and optimum network design problems: Models, solution methods and applications
inferred← citeshttps://doi.org/10.1006/jagm.2000.1088openalex-snapshot
A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees
inferred← citeshttps://doi.org/10.1006/jcss.2001.1787openalex-snapshot
Low Complexity Variants of the Arrow Distributed Directory
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_58openalex-snapshot
A Variant of the Arrow Distributed Directory with Low Average Complexity (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-49116-3_31openalex-snapshot
Constructing Light Spanning Trees with Small Routing Cost
inferred← citeshttps://doi.org/10.1007/3-540-49381-6_43openalex-snapshot
Approximation Algorithms for Some Optimum Communication Spanning Tree Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-09620-9_11openalex-snapshot
Distributed Approximation of Minimum Routing Cost Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-17509-6_12openalex-snapshot
A Relax and Fix Approach to Solve the Fixed Charge Network Design Problem with User-Optimal Flow
inferred← citeshttps://doi.org/10.1007/978-3-540-24749-4_21openalex-snapshot
Approximation Algorithms for Minimizing Average Distortion
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_14openalex-snapshot
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree
inferred← citeshttps://doi.org/10.1007/978-981-95-4839-2_24openalex-snapshot
Approximating Total Effective Resistance Minimization with Small Budget
inferred← citeshttps://doi.org/10.1007/bf02460299openalex-snapshot
Efficient methods for multiple sequence alignment with guaranteed error bounds
inferred← citeshttps://doi.org/10.1007/bfb0030872openalex-snapshot
Compact location problems with budget and communication constraints
inferred← citeshttps://doi.org/10.1007/bfb0121090openalex-snapshot
Tailoring Benders decomposition for uncapacitated network design
inferred← citeshttps://doi.org/10.1007/s00453-012-9674-yopenalex-snapshot
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree
inferred← citeshttps://doi.org/10.1007/s00500-011-0711-6openalex-snapshot
An artificial bee colony algorithm for the minimum routing cost spanning tree problem
inferred← citeshttps://doi.org/10.1007/s00500-018-3557-3openalex-snapshot
The Minimum Routing Cost Tree Problem
inferred← citeshttps://doi.org/10.1007/s10440-008-9215-5openalex-snapshot
On the Minimum Average Distance Spanning Tree of the Hypercube
inferred← citeshttps://doi.org/10.1007/s10878-016-0026-8openalex-snapshot
On the minimum routing cost clustered tree problem
inferred← citeshttps://doi.org/10.1007/s11277-012-0711-6openalex-snapshot
Neighbor Selection Game in Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/s11425-022-2175-5openalex-snapshot
NeuroPrim: An attention-based model for solving NP-hard spanning tree problems
inferred← citeshttps://doi.org/10.1016/0191-2607(85)90044-5openalex-snapshot
Transportation network research: Algorithmic and computational questions
inferred← citeshttps://doi.org/10.1016/j.asoc.2021.107253openalex-snapshot
Adaptive Knowledge Transfer in Multifactorial Evolutionary Algorithm for the Clustered Minimum Routing Cost Problem
inferred← citeshttps://doi.org/10.1016/j.comnet.2008.08.013openalex-snapshot
A fast algorithm for computing minimum routing cost spanning trees
inferred← citeshttps://doi.org/10.1016/j.comnet.2011.10.025openalex-snapshot
Energy-efficient topology control in wireless ad hoc networks with selfish nodes
inferred← citeshttps://doi.org/10.1016/j.cor.2016.06.016openalex-snapshot
A variable fixing heuristic with Local Branching for the fixed charge uncapacitated network design problem with user-optimal flow
inferred← citeshttps://doi.org/10.1016/j.dam.2003.10.002openalex-snapshot
Approximation algorithms for the optimal p-source communication spanning tree
inferred← citeshttps://doi.org/10.1016/j.dam.2021.08.039openalex-snapshot
Bounded-degree light approximate shortest-path trees in doubling metrics
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.08.008openalex-snapshot
Models and algorithms for network reduction
inferred← citeshttps://doi.org/10.1016/j.epsr.2024.110852openalex-snapshot
Exact approaches to solve the Transmission Expansion Planning Problem with Re-design
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.07.056openalex-snapshot
On the intercluster distance of a tree metric
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.116133openalex-snapshot
Approximating total effective resistance minimization with small budget
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00185-2openalex-snapshot
Approximation algorithms for the shortest total path length spanning tree problem
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00212-7openalex-snapshot
Approximation algorithms for some optimum communication spanning tree problems
inferred← citeshttps://doi.org/10.1016/s0196-6774(02)00205-5openalex-snapshot
A polynomial time approximation scheme for the two-source minimum routing cost spanning trees
inferred← citeshttps://doi.org/10.1051/ro:2006003openalex-snapshot
Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité
inferred← citeshttps://doi.org/10.1080/08957340802558367openalex-snapshot
Using a Taxonomy of Differential Step Functioning to Improve the Interpretation of DIF in Polytomous Items: An Illustration
inferred← citeshttps://doi.org/10.1109/csb.2003.1227334openalex-snapshot
Efficient constrained multiple sequence alignment with performance guarantee
inferred← citeshttps://doi.org/10.1109/cse.2014.223openalex-snapshot
Clustered Trees with Minimum Inter-cluster Distance
inferred← citeshttps://doi.org/10.1109/icit.2008.16openalex-snapshot
A New Heuristic for the Minimum Routing Cost Spanning Tree Problem
inferred← citeshttps://doi.org/10.1109/ispdc51135.2020.00028openalex-snapshot
Distributed and Fault-Tolerant Construction of Low Stretch Spanning Tree
inferred← citeshttps://doi.org/10.1109/iwcmc69287.2026.11579921openalex-snapshot
Some Shallow Light Tree Can be Universal and Resilient
inferred← citeshttps://doi.org/10.1109/mascot.2004.1348293openalex-snapshot
End-to-end delay heuristics for adaptive optical wireless networks
inferred← citeshttps://doi.org/10.1109/socpar.2013.7054119openalex-snapshot
An experimental study of minimum routing cost spanning tree algorithms
inferred← citeshttps://doi.org/10.1109/tac.1982.1102873openalex-snapshot
Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition
inferred← citeshttps://doi.org/10.1109/tevc.2008.2008799openalex-snapshot
On the Bias and Performance of the Edge-Set Encoding
inferred← citeshttps://doi.org/10.1111/j.1467-9574.2005.00286.xopenalex-snapshot
Optimization in telecommunication networks
inferred← citeshttps://doi.org/10.1137/090745441openalex-snapshot
A Tight Upper Bound on the Probabilistic Embedding of Series-Parallel Graphs
inferred← citeshttps://doi.org/10.1137/s0097539792236237openalex-snapshot
When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
inferred← citeshttps://doi.org/10.1137/s009753979732253xopenalex-snapshot
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
inferred← citeshttps://doi.org/10.1142/s0219720005000977openalex-snapshot
EFFICIENT CONSTRAINED MULTIPLE SEQUENCE ALIGNMENT WITH PERFORMANCE GUARANTEE
inferred← citeshttps://doi.org/10.1142/s1793830913500109openalex-snapshot
DISTANCE PRESERVING SUBTREES IN MINIMUM AVERAGE DISTANCE SPANNING TREES
inferred← citeshttps://doi.org/10.1145/301250.301366openalex-snapshot
Sublinear time algorithms for metric space problems
inferred← citeshttps://doi.org/10.1155/2019/4947610openalex-snapshot
A Heuristic Algorithm of Cooperative Agents Communication for Enhanced GAF Routing Protocol in WSNs
inferred← citeshttps://doi.org/10.11606/d.45.2021.tde-10032022-204719openalex-snapshot
Optimal Communication Spanning Tree
inferred← citeshttps://doi.org/10.1287/opre.37.5.716openalex-snapshot
A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
inferred← citeshttps://doi.org/10.1287/trsc.18.1.1openalex-snapshot
Network Design and Transportation Planning: Models and Algorithms
inferred← citeshttps://doi.org/10.1287/trsc.32.4.330openalex-snapshot
Constructing Railroad Blocking Plans to Minimize Handling Costs
inferred← citeshttps://doi.org/10.15807/jorsj.35.256openalex-snapshot
THE PROBABILISTIC NETWORK DESIGN PROBLEM
inferred← citeshttps://doi.org/10.1590/s0101-74382003000300007openalex-snapshot
Methodes de decomposition et d'agregation pour le traitement de problemes de multiflots
inferred← citeshttps://doi.org/10.18419/opus-2754openalex-snapshot
Underlay aware approach to support quality of service in publish-subscribe systems
inferred← citeshttps://doi.org/10.32913/mic-ict-research-vn.v2.n30.123openalex-snapshot
Thuật toán tìm kiếm TABU giải bài toán cây khung với chi phí định tuyến nhỏ nhất
inferred← citeshttps://doi.org/10.4018/978-1-61350-086-6.ch013openalex-snapshot
A Hybrid Lagrangian Relaxation and Tabu Search Method for Interdependent-Choice Network Design Problems
inferred← citeshttps://doi.org/10.4018/ijoris.20211001.oa5openalex-snapshot
Bus Transit Network Structure Selection With Multiple Objectives
inferred← citeshttps://doi.org/10.48550/arxiv.0705.2125openalex-snapshot
Parallelized approximation algorithms for minimum routing cost spanning trees
inferred← citeshttps://doi.org/10.48550/arxiv.1301.3252openalex-snapshot
Approximating Metrics by Tree Metrics of Small Distance-Weighted Average Stretch
inferred← citeshttps://doi.org/10.48550/arxiv.1605.06882openalex-snapshot
Distributed Local Multi-Aggregation and Centrality Approximation
inferred← citeshttps://doi.org/10.48550/arxiv.1712.04010openalex-snapshot
The Minimum Edge Compact Spanner Network Design Problem
inferred← citeshttps://doi.org/10.5353/th_b3020194openalex-snapshot
Algorithms on constrained sequence alignment
inferred← citeshttps://doi.org/10.5555/1109557.1109673openalex-snapshot
A tight upper bound on the probabilistic embedding of series-parallel graphs
inferred← citeshttps://doi.org/10.5860/choice.42-1619aopenalex-snapshot
Spanning trees and optimization problems
inferred← citeshttps://doi.org/10.70675/11cb650fzd30bz4f42z94ffz0e8c0874b9cfopenalex-snapshot
Contributions à la conception de réseaux avec coûts fixes et routes optimales pour les usagers
inferred← citeshttps://doi.org/10.70675/909bbe94z5fa8z4ba3z80bbzc56545575d65openalex-snapshot
Characterizing edges in signed and vector-valued graphs
inferred← citeshttps://doi.org/10.7763/ijmlc.2012.v2.154openalex-snapshot
A Heuristic Approach for Solving Minimum Routing Cost Spanning Tree Problem
inferred← citeshttps://doi.org/10.7763/ijmlc.2012.v2.155openalex-snapshot
A Genetic Approach for Solving Minimum Routing Cost Spanning Tree Problem
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.