On the public citation graph
A Constant-Factor Approximation Algorithm for thek-MST Problem
0 signed · 74 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/1520-6750(198706)34:3<307::aid-nav3220340302>3.0.co;2-dopenalex-snapshot
The orienteering problem
inferredcites →https://doi.org/10.1002/net.3230190602openalex-snapshot
The prize collecting traveling salesman problem
inferredcites →https://doi.org/10.1002/net.3230240103openalex-snapshot
Weighted k‐cardinality trees: Complexity and polyhedral structure
inferredcites →https://doi.org/10.1109/sfcs.1996.548458openalex-snapshot
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
inferredcites →https://doi.org/10.1109/sfcs.1996.548489openalex-snapshot
A 3-approximation for the minimum tree spanning k vertices
inferredcites →https://doi.org/10.1137/s0097539793242618openalex-snapshot
A General Approximation Technique for Constrained Forest Problems
inferredcites →https://doi.org/10.1145/195058.195218openalex-snapshot
An O (log k ) approximation algorithm for the k minimum spanning tree problem in the plane
inferredcites →https://doi.org/10.1145/225058.225139openalex-snapshot
Improved approximation guarantees for minimum-weight k -trees and prize-collecting salesmen
inferredcites →https://doi.org/10.1145/225058.225143openalex-snapshot
A constant-factor approximation for the k -MST problem in the plane
inferredcites →https://doi.org/10.5555/313852.313909openalex-snapshot
An improved approximation ratio for the minimum latency problem
inferredcites →https://doi.org/10.5555/313852.314090openalex-snapshot
Guillotine subdivisions approximate polygonal subdivisions: a simple new method for the geometric k-MST problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11841036_54openalex-snapshot
Approximate k-Steiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing
inferred← citeshttps://doi.org/10.1007/3-540-45471-3_20openalex-snapshot
The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45471-3_33openalex-snapshot
On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem
inferred← citeshttps://doi.org/10.1007/3-540-45535-3_5openalex-snapshot
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation
inferred← citeshttps://doi.org/10.1007/3-540-61422-2_118openalex-snapshot
Service-constrained network design problems
inferred← citeshttps://doi.org/10.1007/978-3-030-61792-9_7openalex-snapshot
A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-69244-5_33openalex-snapshot
The Prize-Collecting k-Steiner Tree Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-12691-3_21openalex-snapshot
Algorithms for the Maximum Weight Connected $$k$$-Induced Subgraph Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-74484-9_45openalex-snapshot
Approximation Algorithms for 2-Source Minimum Routing Cost k-Tree Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-85363-3_19openalex-snapshot
A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs
inferred← citeshttps://doi.org/10.1007/978-3-642-12200-2_44openalex-snapshot
Euclidean Prize-Collecting Steiner Forest
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_4openalex-snapshot
Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k,2)-Subgraph
inferred← citeshttps://doi.org/10.1007/s00453-008-9189-8openalex-snapshot
Approximate k-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing
inferred← citeshttps://doi.org/10.1007/s00453-011-9491-8openalex-snapshot
Euclidean Prize-Collecting Steiner Forest
inferred← citeshttps://doi.org/10.1007/s10107-003-0479-2openalex-snapshot
Approximate k -MSTs and k -Steiner trees via the primal-dual method and Lagrangean relaxation
inferred← citeshttps://doi.org/10.1007/s10107-005-0693-1openalex-snapshot
A 2 + ɛ approximation algorithm for the k-MST problem
inferred← citeshttps://doi.org/10.1007/s10878-014-9774-5openalex-snapshot
Improved approximations for buy-at-bulk and shallow-light $$k$$ k -Steiner trees and $$(k,2)$$ ( k , 2 ) -subgraph
inferred← citeshttps://doi.org/10.1007/s11590-017-1135-8openalex-snapshot
A 5-approximation algorithm for the k-prize-collecting Steiner tree problem
inferred← citeshttps://doi.org/10.1007/s11590-018-1367-2openalex-snapshot
A 4-approximation algorithm for k-prize collecting Steiner tree problems
inferred← citeshttps://doi.org/10.1007/s12597-020-00463-8openalex-snapshot
Two multi-start heuristics for the k-traveling salesman problem
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50010-3openalex-snapshot
Spanning Trees and Spanners
inferred← citeshttps://doi.org/10.1016/j.artint.2012.12.003openalex-snapshot
Physical search problems with probabilistic knowledge
inferred← citeshttps://doi.org/10.1016/j.asoc.2014.08.057openalex-snapshot
The generalized covering traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.asoc.2019.03.001openalex-snapshot
An artificial bee colony algorithm with variable degree of perturbation for the generalized covering traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.dam.2005.05.036openalex-snapshot
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.02.009openalex-snapshot
Solving the traveling repairman problem on a line with general processing times and deadlines
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.06.013openalex-snapshot
Algorithms for the On-Line Quota Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.03.002openalex-snapshot
The online Prize-Collecting Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.11.001openalex-snapshot
An online throughput-competitive algorithm for multicast routing and admission control
inferred← citeshttps://doi.org/10.1016/j.orl.2018.10.002openalex-snapshot
An approximation algorithm for vehicle routing with compatibility constraints
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.02.046openalex-snapshot
Complexity and approximation for Traveling Salesman Problems with profits
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00010-6openalex-snapshot
A 2.5-factor approximation algorithm for the k-MST problem
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00548-6openalex-snapshot
Local search algorithms for the k-cardinality tree problem
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00290-9openalex-snapshot
Modifying edges of a network to obtain short subgraphs
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00021-1openalex-snapshot
Faster geometric k-point MST approximation
inferred← citeshttps://doi.org/10.1017/cbo9780511921735openalex-snapshot
The Design of Approximation Algorithms
inferred← citeshttps://doi.org/10.1109/icdm.2007.11openalex-snapshot
Efficient Algorithms for Mining Significant Substructures in Graphs with Quality Guarantees
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238179openalex-snapshot
Paths, trees, and minimum latency tours
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238180openalex-snapshot
Approximation algorithms for orienteering and discounted-reward TSP
inferred← citeshttps://doi.org/10.1109/tnsre.2017.2679056openalex-snapshot
Network Optimization of Functional Connectivity Within Default Mode Network Regions to Detect Cognitive Decline
inferred← citeshttps://doi.org/10.1137/040617339openalex-snapshot
Approximate Integer Decompositions for Undirected Network Design Problems
inferred← citeshttps://doi.org/10.1137/050645464openalex-snapshot
Approximation Algorithms for Orienteering and Discounted-Reward TSP
inferred← citeshttps://doi.org/10.1137/070700620openalex-snapshot
Survivable Network Design with Degree or Order Constraints
inferred← citeshttps://doi.org/10.1137/080729918openalex-snapshot
A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs
inferred← citeshttps://doi.org/10.1137/s0097539702420474openalex-snapshot
Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems
inferred← citeshttps://doi.org/10.1145/1077464.1077470openalex-snapshot
On network design problems: fixed cost flows and the covering steiner problem
inferred← citeshttps://doi.org/10.1145/1250790.1250886openalex-snapshot
Survivable network design with degree or order constraints
inferred← citeshttps://doi.org/10.1145/1498698.1537600openalex-snapshot
Obtaining optimal k -cardinality trees fast
inferred← citeshttps://doi.org/10.1145/2229163.2229167openalex-snapshot
Improved algorithms for orienteering and related problems
inferred← citeshttps://doi.org/10.1201/9781351236423-34openalex-snapshot
Prize Collecting Traveling Salesman and Related Problems
inferred← citeshttps://doi.org/10.1287/moor.2019.1002openalex-snapshot
Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
inferred← citeshttps://doi.org/10.1287/trsc.1030.0079openalex-snapshot
Traveling Salesman Problems with Profits
inferred← citeshttps://doi.org/10.48550/arxiv.0802.2528openalex-snapshot
Min-Cost 2-Connected Subgraphs With k Terminals
inferred← citeshttps://doi.org/10.48550/arxiv.0912.1137openalex-snapshot
Euclidean Prize-collecting Steiner Forest
inferred← citeshttps://doi.org/10.5555/314613.314685openalex-snapshot
Online througput-competitive algorithm for multicast routing and admission control
inferred← citeshttps://doi.org/10.5555/338219.338636openalex-snapshot
A 2 + ε approximation algorithm for the k-MST problem
inferred← citeshttps://doi.org/10.6100/ir616430openalex-snapshot
Models and algorithms for online server routing
inferred← citeshttps://doi.org/10.7939/r3gb1xt6vopenalex-snapshot
Improved approximation algorithms for Min-Max Tree Cover, Bounded Tree Cover, Shallow-Light and Buy-at-Bulk k-Steiner Tree, and (k, 2)-Subgraph
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.