On the public citation graph

Minimax flow tree problems

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.
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/nav.20302openalex-snapshot
Network design for time‐constrained delivery
inferredcites →https://doi.org/10.1002/net.3230080402openalex-snapshot
The complexity of the network design problem
inferredcites →https://doi.org/10.1006/jagm.1996.0054openalex-snapshot
Off-Line Maintenance of Planar Configurations
inferredcites →https://doi.org/10.1007/11602613_107openalex-snapshot
Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics
inferredcites →https://doi.org/10.1007/bfb0055092openalex-snapshot
Deterministic polylog approximation for minimum communication spanning trees
inferredcites →https://doi.org/10.1016/0020-0190(94)00183-yopenalex-snapshot
On the minimum diameter spanning tree problem
inferredcites →https://doi.org/10.1016/0305-0548(94)00074-iopenalex-snapshot
Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints
inferredcites →https://doi.org/10.1016/0377-2217(95)00090-9openalex-snapshot
Multicommodity flow models for spanning trees with hop constraints
inferredcites →https://doi.org/10.1016/j.dam.2003.12.004openalex-snapshot
An improved algorithm for the k-source maximum eccentricity spanning trees
inferredcites →https://doi.org/10.1016/j.orl.2004.05.005openalex-snapshot
Approximating k-hop minimum-spanning trees
inferredcites →https://doi.org/10.1016/s0166-218x(00)00185-2openalex-snapshot
Approximation algorithms for the shortest total path length spanning tree problem
inferredcites →https://doi.org/10.1016/s0166-218x(02)00420-1openalex-snapshot
The complexity of minimizing certain cost metrics for k-source spanning trees
inferredcites →https://doi.org/10.1016/s0166-218x(03)00262-2openalex-snapshot
Multi-source spanning trees: algorithms for minimizing source eccentricities
inferredcites →https://doi.org/10.1016/s0166-218x(99)00212-7openalex-snapshot
Approximation algorithms for some optimum communication spanning tree problems
inferredcites →https://doi.org/10.1016/s0167-6377(98)00029-7openalex-snapshot
The 2-hop spanning tree problem
inferredcites →https://doi.org/10.1016/s0196-6774(02)00205-5openalex-snapshot
A polynomial time approximation scheme for the two-source minimum routing cost spanning trees
inferredcites →https://doi.org/10.1016/s0377-2217(00)00143-0openalex-snapshot
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
inferredcites →https://doi.org/10.1023/a:1018967121276openalex-snapshot
The Steiner tree problem with hop constraints
inferredcites →https://doi.org/10.1137/0137040openalex-snapshot
An Algorithmic Approach to Network Location Problems. I: The p -Centers
inferredcites →https://doi.org/10.1137/0203015openalex-snapshot
Optimum Communication Spanning Trees
inferredcites →https://doi.org/10.1137/0220060openalex-snapshot
Minimum Diameter Spanning Trees and Related Problems
inferredcites →https://doi.org/10.1137/s009753979732253xopenalex-snapshot
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
inferredcites →https://doi.org/10.1137/s0895480192237403openalex-snapshot
Tree Spanners
inferredcites →https://doi.org/10.1142/s0219265900000056openalex-snapshot
MULTI-SOURCE SPANNING TREE PROBLEMS
inferredcites →https://doi.org/10.1145/10515.10534openalex-snapshot
There is a planar graph almost as good as the complete graph
inferredcites →https://doi.org/10.1145/28869.28874openalex-snapshot
Fibonacci heaps and their uses in improved network optimization algorithms
inferredcites →https://doi.org/10.1145/41840.41847openalex-snapshot
An optimal synchronizer for the hypercube
inferredcites →https://doi.org/10.1287/ijoc.10.2.180openalex-snapshot
Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
inferredcites →https://doi.org/10.1287/opre.12.3.450openalex-snapshot
Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
inferredcites →https://doi.org/10.1287/trsc.21.3.163openalex-snapshot
Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem
inferredcites →https://doi.org/10.1287/trsc.26.3.230openalex-snapshot
Shipment Routing Algorithms with Tree Constraints
inferredcites →https://doi.org/10.1287/trsc.7.3.287openalex-snapshot
Minimax Location of a Facility in an Undirected Tree Graph
inferredcites →https://doi.org/10.1287/trsc.8.4.333openalex-snapshot
A Minimax Location Problem on a Network
inferredcites →https://doi.org/10.46298/dmtcs.278openalex-snapshot
Minimum Eccentricity Multicast Trees

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s10287-012-0154-2openalex-snapshot
Network design for time-constrained delivery using subgraphs
inferred← citeshttps://doi.org/10.1016/j.cie.2018.12.029openalex-snapshot
On a fully fuzzy framework for minimax mixed integer linear programming
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.11.009openalex-snapshot
General network design: A unified view of combined location and network design problems
inferred← citeshttps://doi.org/10.1016/j.sigpro.2014.07.006openalex-snapshot
Distributed estimation of the inverse of the correlation matrix for privacy preserving beamforming
inferred← citeshttps://doi.org/10.1016/j.sigpro.2021.108085openalex-snapshot
Distributed node-specific block-diagonal LCMV beamforming in wireless acoustic sensor networks
inferred← citeshttps://doi.org/10.1109/icassp39728.2021.9414456openalex-snapshot
Scalable and Distributed MMSE Algorithms for Uplink Receive Combining in Cell-Free Massive MIMO Systems
inferred← citeshttps://doi.org/10.1109/jiot.2025.3578890openalex-snapshot
Robust Distributed MVDR Beamforming in Wireless Acoustic Sensor Networks With Subnetwork Selection
inferred← citeshttps://doi.org/10.1109/jsen.2022.3195566openalex-snapshot
Robust Distributed Noise Suppression in Acoustic Sensor Networks
inferred← citeshttps://doi.org/10.1109/ojsp.2024.3377098openalex-snapshot
Distributed Combined Channel Estimation and Optimal Uplink Receive Combining for User- Centric Cell-Free Massive MIMO Systems
inferred← citeshttps://doi.org/10.1109/tsipn.2016.2623095openalex-snapshot
Topology-Independent Distributed Adaptive Node-Specific Signal Estimation in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tsipn.2026.3674663openalex-snapshot
Fast-Converging Distributed Signal Estimation in Topology-Unconstrained Wireless Acoustic Sensor Networks
inferred← citeshttps://doi.org/10.1109/tsp.2011.2108290openalex-snapshot
Distributed Adaptive Estimation of Node-Specific Signals in Wireless Sensor Networks With a Tree Topology
inferred← citeshttps://doi.org/10.1186/s13638-023-02251-6openalex-snapshot
Distributed MMSE-based uplink receive combining, downlink transmit precoding and optimal power allocation in cell-free massive MIMO systems
inferred← citeshttps://doi.org/10.23919/eusipco47968.2020.9287771openalex-snapshot
Distributed Adaptive Acoustic Contrast Control for Node-specific Sound Zoning in a Wireless Acoustic Sensor and Actuator Network
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.