On the public citation graph
The maximum‐leaf spanning tree problem: Formulations and facets
0 signed · 48 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/9781118627372openalex-snapshot
Integer and Combinatorial Optimization
inferredcites →https://doi.org/10.1006/jagm.1998.0944openalex-snapshot
Approximating Maximum Leaf Spanning Trees in Almost Linear Time
inferredcites →https://doi.org/10.1007/3-540-61680-2_55openalex-snapshot
Approximation algorithms for connected dominating sets
inferredcites →https://doi.org/10.1007/3-540-68530-8_37openalex-snapshot
2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/pl00009201openalex-snapshot
Approximation Algorithms for Connected Dominating Sets
inferredcites →https://doi.org/10.1016/0020-0190(81)90141-1openalex-snapshot
Constructing full spanning trees for cubic graphs
inferredcites →https://doi.org/10.1016/0020-0190(94)90139-2openalex-snapshot
A short note on the approximability of the maximum leaves spanning tree problem
inferredcites →https://doi.org/10.1016/s0305-0548(02)00117-xopenalex-snapshot
An exact algorithm for the maximum leaf spanning tree problem
inferredcites →https://doi.org/10.1016/s0377-2217(96)00327-xopenalex-snapshot
Minimal spanning trees with a constraint on the number of leaves
inferredcites →https://doi.org/10.1017/cbo9781107325630.013openalex-snapshot
ENCYCLOPEDIA OF MATHEMATICS AND ITS APPLICATIONS
inferredcites →https://doi.org/10.2307/2007638openalex-snapshot
Encyclopedia of Mathematics and its Applications.
inferredcites →https://doi.org/10.2307/2583737openalex-snapshot
Integer and Combinatorial Optimization
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.21722openalex-snapshot
A node‐based ILP formulation for the node‐weighted dominating Steiner problem
inferred← citeshttps://doi.org/10.1002/net.21728openalex-snapshot
Restricted swap-based neighborhood search for the minimum connected dominating set problem
inferred← citeshttps://doi.org/10.1002/net.22005openalex-snapshot
Solving Steiner trees: Recent advances, challenges, and perspectives
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_37openalex-snapshot
2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves
inferred← citeshttps://doi.org/10.1007/978-3-030-48439-2_22openalex-snapshot
Layout Problems with Reachability Constraint
inferred← citeshttps://doi.org/10.1007/978-3-319-07046-9_4openalex-snapshot
Solving the Quorumcast Routing Problem as a Mixed Integer Program
inferred← citeshttps://doi.org/10.1007/978-3-319-09174-7_13openalex-snapshot
Finding Totally Independent Spanning Trees with Linear Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-319-24598-0_29openalex-snapshot
Beyond Unfeasibility: Strategic Oscillation for the Maximum Leaf Spanning Tree Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_78openalex-snapshot
Spanning Trees with Many Leaves in Regular Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-21527-8_11openalex-snapshot
Reformulation by Intersection Method on the MST Problem with Lower Bound on the Number of Leaves
inferred← citeshttps://doi.org/10.1007/978-3-642-21527-8_21openalex-snapshot
The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm
inferred← citeshttps://doi.org/10.1007/s10287-009-0116-5openalex-snapshot
Reformulations and solution algorithms for the maximum leaf spanning tree problem
inferred← citeshttps://doi.org/10.1007/s10479-018-2943-7openalex-snapshot
Optimization of wireless sensor networks deployment with coverage and connectivity constraints
inferred← citeshttps://doi.org/10.1007/s11107-022-00983-xopenalex-snapshot
On regenerator site selection in translucent optical network design
inferred← citeshttps://doi.org/10.1007/s13748-015-0076-7openalex-snapshot
Parallel strategic oscillation: an application to the maximum leaf spanning tree problem
inferred← citeshttps://doi.org/10.1016/j.cor.2016.12.005openalex-snapshot
Spanning trees with a constraint on the number of leaves. A new formulation
inferred← citeshttps://doi.org/10.1016/j.cor.2019.104847openalex-snapshot
A Branch-And-Benders-Cut approach for the fault tolerant regenerator location problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2013.11.036openalex-snapshot
On connected dominating sets of restricted diameter
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.07.032openalex-snapshot
Regenerator location problem: Polyhedral study and effective branch-and-cut algorithms
inferred← citeshttps://doi.org/10.1016/j.endm.2015.07.035openalex-snapshot
Flow-based formulation for the maximum leaf spanning tree problem
inferred← citeshttps://doi.org/10.1016/s0305-0548(02)00117-xopenalex-snapshot
An exact algorithm for the maximum leaf spanning tree problem
inferred← citeshttps://doi.org/10.1080/0305215x.2022.2067151openalex-snapshot
A new formulation and algorithm for the maximum leaf spanning tree problem with an application in forest fire detection
inferred← citeshttps://doi.org/10.1109/codit.2017.8102614openalex-snapshot
Optimization of wireless sensor networks deployment with coverage and connectivity constraints
inferred← citeshttps://doi.org/10.1111/itor.12857openalex-snapshot
Branch‐and‐cut algorithms for the ‐arborescence star problem
inferred← citeshttps://doi.org/10.11606/t.45.2017.tde-27062017-101521openalex-snapshot
The k-hop connected dominating set problem: approximation algorithms and hardness results
inferred← citeshttps://doi.org/10.1287/ijoc.2013.0589openalex-snapshot
Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem
inferred← citeshttps://doi.org/10.1287/ijoc.2014.0619openalex-snapshot
An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets
inferred← citeshttps://doi.org/10.1287/ijoc.2019.0914openalex-snapshot
The Optimal Design of Low-Latency Virtual Backbones
inferred← citeshttps://doi.org/10.1287/ijoc.2021.1106openalex-snapshot
A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets
inferred← citeshttps://doi.org/10.1287/trsc.2021.1049openalex-snapshot
Layout Design of Parking Lots with Mathematical Programming
inferred← citeshttps://doi.org/10.18255/1818-1015-2015-4-453-463openalex-snapshot
1-Skeletons of the Spanning Tree Problems with Additional Constraints
inferred← citeshttps://doi.org/10.3103/s0146411617070033openalex-snapshot
1-Skeletons of the Spanning Tree Problems with Additional Constraints
inferred← citeshttps://doi.org/10.5861/ijrsc.2014.603openalex-snapshot
Spanning tree with many leaves in quadratic graph
inferred← citeshttps://doi.org/10.70675/9ca710f6z2d41z4911za9b6z0eb715cfebfbopenalex-snapshot
Déploiement optimal d’un réseau de capteurs sous des contraintes de couverture et de connectivité
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.