On the public citation graph
Balancing minimum spanning trees and shortest-path trees
0 signed · 247 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/j.1538-7305.1957.tb01515.xopenalex-snapshot
Shortest Connection Networks And Some Generalizations
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/bf01758846openalex-snapshot
There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees
inferredcites →https://doi.org/10.1007/bf02189308openalex-snapshot
On sparse spanners of weighted graphs
inferredcites →https://doi.org/10.1007/bf02574695openalex-snapshot
A sparse graph almost as good as the complete graph on points inK dimensions
inferredcites →https://doi.org/10.1007/bf02579168openalex-snapshot
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
inferredcites →https://doi.org/10.1016/0022-0000(89)90044-5openalex-snapshot
There are planar graphs almost as good as the complete graph
inferredcites →https://doi.org/10.1090/s0002-9939-1956-0078686-7openalex-snapshot
On the shortest spanning subtree of a graph and the traveling salesman problem
inferredcites →https://doi.org/10.1109/43.137519openalex-snapshot
Provably good performance-driven global routing
inferredcites →https://doi.org/10.1109/iccd.1991.139874openalex-snapshot
Performance-driven global routing for cell based ICs
inferredcites →https://doi.org/10.1109/iscas.1992.230514openalex-snapshot
Provably good algorithms for performance-driven global routing
inferredcites →https://doi.org/10.1109/tcom.1983.1095818openalex-snapshot
Routing to Multiple Destinations in Computer Networks
inferredcites →https://doi.org/10.1145/142675.142717openalex-snapshot
New sparseness results on graph spanners
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.1145/93385.93417openalex-snapshot
Cost-sensitive analysis of communication protocols
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1097-0037(200101)37:1<8::aid-net2>3.0.co;2-ropenalex-snapshot
An improved approximation scheme for the Group Steiner Problem
inferred← citeshttps://doi.org/10.1002/ar.23700openalex-snapshot
Development and Assessment of Fully Automated and Globally Transitive Geometric Morphometric Methods, With Application to a Biological Comparative Dataset With High Interspecific Variation
inferred← citeshttps://doi.org/10.1002/dac.685openalex-snapshot
A new delay‐constrained algorithm for multicast routing tree construction
inferred← citeshttps://doi.org/10.1002/mma.2904openalex-snapshot
Clifford algebra method for network expression, computation, and algorithm construction
inferred← citeshttps://doi.org/10.1002/net.10019openalex-snapshot
Light graphs with small routing cost
inferred← citeshttps://doi.org/10.1002/net.20028openalex-snapshot
Trade‐offs on the location of the core node in a network
inferred← citeshttps://doi.org/10.1006/jagm.1997.0862openalex-snapshot
A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees
inferred← citeshttps://doi.org/10.1006/jagm.1998.0930openalex-snapshot
Bicriteria Network Design Problems
inferred← citeshttps://doi.org/10.1006/jpdc.2001.1752openalex-snapshot
Delay-Constrained, Low-Cost Multicast Routing in Multimedia Networks
inferred← citeshttps://doi.org/10.1007/11780823_23openalex-snapshot
On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem
inferred← citeshttps://doi.org/10.1007/11823285_54openalex-snapshot
Distributed Approximation Allocation Resources Algorithm for Connecting Groups
inferred← citeshttps://doi.org/10.1007/3-540-44436-x_17openalex-snapshot
Approximation Algorithms for a Capacitated Network Design Problem
inferred← citeshttps://doi.org/10.1007/3-540-45535-3_14openalex-snapshot
On the Integrality Gap of a Natural Formulation of the Single-sink Buy-at-Bulk Network Design Problem
inferred← citeshttps://doi.org/10.1007/3-540-45678-3_17openalex-snapshot
Tree-Approximations for the Weighted Cost-Distance Problem
inferred← citeshttps://doi.org/10.1007/3-540-45753-4_2openalex-snapshot
Bicriteria Spanning Tree Problems
inferred← citeshttps://doi.org/10.1007/3-540-47867-1_33openalex-snapshot
The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap
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-61310-2_9openalex-snapshot
A network-flow technique for finding low-weight bounded-degree spanning trees
inferred← citeshttps://doi.org/10.1007/978-1-4613-3282-4_3openalex-snapshot
Random Sampling Techniques in Parallel Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-80879-2_13openalex-snapshot
An Improved Approximation Algorithm for the Uniform Cost-Distance Steiner Tree Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-86838-3_28openalex-snapshot
On Additive Spanners in Weighted Graphs with Local Error
inferred← citeshttps://doi.org/10.1007/978-3-031-75409-8_17openalex-snapshot
Lightweight Near-Additive Spanners
inferred← citeshttps://doi.org/10.1007/978-3-031-84263-4_15openalex-snapshot
Visualization Examples in Financial Process Mining
inferred← citeshttps://doi.org/10.1007/978-3-032-13048-8_6openalex-snapshot
Critical Edge Guided Genetic Algorithm with Adaptive Mutation for Layer-2 Network Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-11197-1_8openalex-snapshot
Probability Based Algorithms for Guaranteeing the Stability of Rechargeable Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-13915-9_3openalex-snapshot
Rectilinear Steiner Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-21840-3_31openalex-snapshot
LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design
inferred← citeshttps://doi.org/10.1007/978-3-319-40132-4_13openalex-snapshot
Genetic Algorithms for Constrained Tree Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-27796-5_23openalex-snapshot
Sharing the Cost of Multicast Transmissions in Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-30140-0_70openalex-snapshot
Construction of Minimum-Weight Spanners
inferred← citeshttps://doi.org/10.1007/978-3-540-45209-6_124openalex-snapshot
Construction of Efficient Communication Sub-structures: Non-approximability Results and Polynomial Sub-cases
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_31openalex-snapshot
Approximating Capacitated Tree-Routings in Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_27openalex-snapshot
Approximation to the Minimum Cost Edge Installation Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-02882-3_16openalex-snapshot
Approximation Algorithms for Key Management in Secure Multicast
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_23openalex-snapshot
Geodesic Spanners on Polyhedral Surfaces
inferred← citeshttps://doi.org/10.1007/978-3-642-14849-1_3openalex-snapshot
Maintaining Connectivity in Sensor Networks Using Directional Antennae
inferred← citeshttps://doi.org/10.1007/978-3-642-17461-2_6openalex-snapshot
Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded Angle
inferred← citeshttps://doi.org/10.1007/978-3-642-20807-2_19openalex-snapshot
Capacitated Vehicle Routing with Non-uniform Speeds
inferred← citeshttps://doi.org/10.1007/978-3-642-35843-2_30openalex-snapshot
Approximating the k-Splittable Capacitated Network Design Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-36694-9_20openalex-snapshot
Shallow-Light Steiner Arborescences with Vertex Delays
inferred← citeshttps://doi.org/10.1007/978-3-642-38416-5_14openalex-snapshot
Genetic Algorithms for Dynamic Routing Problems in Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-40450-4_60openalex-snapshot
Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections
inferred← citeshttps://doi.org/10.1007/bf02684360openalex-snapshot
Spanning trees and shortest paths in monge graphs
inferred← citeshttps://doi.org/10.1007/s00453-005-1155-0openalex-snapshot
Simultaneous Optimization for Concave Costs: Single Sink Aggregation or Single Source Buy-at-Bulk
inferred← citeshttps://doi.org/10.1007/s00453-018-0458-xopenalex-snapshot
LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design
inferred← citeshttps://doi.org/10.1007/s10107-020-01614-xopenalex-snapshot
Electrical flows over spanning trees
inferred← citeshttps://doi.org/10.1007/s10732-014-9250-5openalex-snapshot
Improved structures for data collection in static and mobile wireless sensor networks
inferred← citeshttps://doi.org/10.1007/s10878-009-9238-5openalex-snapshot
Approximating capacitated tree-routings in networks
inferred← citeshttps://doi.org/10.1007/s10878-025-01289-0openalex-snapshot
A multi-objective perspective on the cable-trench problem
inferred← citeshttps://doi.org/10.1007/s11107-011-0335-xopenalex-snapshot
New algorithms for multicast routing and wavelength assignment in multi-hop optical WDM networks
inferred← citeshttps://doi.org/10.1007/s11276-007-0050-9openalex-snapshot
Scheduling for information gathering on sensor network
inferred← citeshttps://doi.org/10.1007/s11831-023-10007-0openalex-snapshot
Reviews, Challenges, and Insights on Computational Methods for Network Reconfigurations in Smart Electricity Distribution Networks
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50010-3openalex-snapshot
Spanning Trees and Spanners
inferred← citeshttps://doi.org/10.1016/j.adhoc.2013.06.004openalex-snapshot
An exploration of aggregation convergecast scheduling
inferred← citeshttps://doi.org/10.1016/j.comcom.2006.01.032openalex-snapshot
Energy efficient routing and scheduling for real-time data aggregation in WSNs
inferred← citeshttps://doi.org/10.1016/j.comcom.2006.02.015openalex-snapshot
QoS multicast routing for multimedia group communications using intelligent computational methods
inferred← citeshttps://doi.org/10.1016/j.comcom.2007.12.034openalex-snapshot
Fuzzy priority based overlay multicast
inferred← citeshttps://doi.org/10.1016/j.comgeo.2019.01.003openalex-snapshot
Minimizing the sum of distances to a server in a constraint network
inferred← citeshttps://doi.org/10.1016/j.comnet.2004.11.019openalex-snapshot
Placement of proxy-based multicast overlays
inferred← citeshttps://doi.org/10.1016/j.comnet.2010.05.018openalex-snapshot
Multi-objective optimization of multicast overlays for collaborative applications
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106307openalex-snapshot
Advanced Network Connectivity Features and Zonal Requirements in Covering Location Problems
inferred← citeshttps://doi.org/10.1016/j.crhy.2018.10.006openalex-snapshot
Transitions in spatial networks
inferred← citeshttps://doi.org/10.1016/j.dam.2005.04.018openalex-snapshot
Competitive algorithms for the bicriteria k -server problem
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.dam.2023.07.010openalex-snapshot
On the complexity of the Cable-Trench Problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2016.09.001openalex-snapshot
Approximating the k -splittable capacitated network design problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2019.03.003openalex-snapshot
Vehicle routing with subtours
inferred← citeshttps://doi.org/10.1016/j.ejor.2022.06.021openalex-snapshot
Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time
inferred← citeshttps://doi.org/10.1016/j.engappai.2010.01.021openalex-snapshot
Genetic algorithms with immigrants schemes for dynamic multicast problems in mobile ad hoc networks
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.11.021openalex-snapshot
Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.06.015openalex-snapshot
Reducing the diameter of a unit disk graph via node addition
inferred← citeshttps://doi.org/10.1016/j.jda.2009.08.002openalex-snapshot
On the approximation of the generalized capacitated tree-routing problem
inferred← citeshttps://doi.org/10.1016/j.jpdc.2004.08.007openalex-snapshot
An efficient algorithm for constructing delay bounded minimum cost multicast trees
inferred← citeshttps://doi.org/10.1016/j.orl.2016.10.010openalex-snapshot
Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology
inferred← citeshttps://doi.org/10.1016/j.procs.2021.11.009openalex-snapshot
On the Inapproximability of the Cable-Trench Problem
inferred← citeshttps://doi.org/10.1016/j.swevo.2016.06.005openalex-snapshot
Genetic algorithms to balanced tree structures in graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115486openalex-snapshot
Arborescences and shortest path trees when colors matter
inferred← citeshttps://doi.org/10.1016/s0140-3664(01)00299-7openalex-snapshot
Integrated algorithms for delay bounded multicast routing and wavelength assignment in all optical networks
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00445-1openalex-snapshot
Delay-related secondary objectives for rectilinear Steiner minimum trees
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00111-0openalex-snapshot
Approximating the weight of shallow Steiner trees
inferred← citeshttps://doi.org/10.1016/s0276-8976(06)12010-6openalex-snapshot
Selection criteria for a network design model with uncertain demand
inferred← citeshttps://doi.org/10.1016/s0305-0548(00)00083-6openalex-snapshot
The cable trench problem: combining the shortest path and minimum spanning tree problems
inferred← citeshttps://doi.org/10.1016/s1570-8667(03)00033-9openalex-snapshot
The non-approximability of bicriteria network design problems
inferred← citeshttps://doi.org/10.1080/15501320701585527openalex-snapshot
Data Gathering Schedule for Minimal Aggregation Time in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1088/1742-5468/2006/07/l07002openalex-snapshot
Optimal traffic networks
inferred← citeshttps://doi.org/10.1089/cmb.2021.0361openalex-snapshot
A Mathematical Framework for Analyzing Wild Tomato Root Architecture
inferred← citeshttps://doi.org/10.1098/rspb.2018.2727openalex-snapshot
Neural arbors are Pareto optimal
inferred← citeshttps://doi.org/10.1109/26.905896openalex-snapshot
Optimization of wavelength assignment for QoS multicast in WDM networks
inferred← citeshttps://doi.org/10.1109/4234.984702openalex-snapshot
Multicast routing, load balancing, and wavelength assignment on tree of rings
inferred← citeshttps://doi.org/10.1109/43.391737openalex-snapshot
Prim-Dijkstra tradeoffs for improved performance-driven routing tree design
inferred← citeshttps://doi.org/10.1109/43.476573openalex-snapshot
Near-optimal critical sink routing tree constructions
inferred← citeshttps://doi.org/10.1109/43.602477openalex-snapshot
Performance-driven routing with multiple sources
inferred← citeshttps://doi.org/10.1109/43.875285openalex-snapshot
New approximation algorithms for routing with multiport terminals
inferred← citeshttps://doi.org/10.1109/49.564135openalex-snapshot
Destination-driven routing for low-cost multicast
inferred← citeshttps://doi.org/10.1109/apcas.1996.569294openalex-snapshot
Cost-radius balanced spanning/Steiner trees
inferred← citeshttps://doi.org/10.1109/ccbd.2015.48openalex-snapshot
Determining an Efficient Family of Trees in Large Scale Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/ccgrid.2009.38openalex-snapshot
Multicast Trees for Collaborative Applications
inferred← citeshttps://doi.org/10.1109/comst.2026.3731146openalex-snapshot
Approximation Algorithms for Vehicle Routing Problems: A Survey
inferred← citeshttps://doi.org/10.1109/cso.2011.93openalex-snapshot
Approximation Algorithms for Multicast Routing and Wavelength Assignment in Multi-hop Optical WDM Networks
inferred← citeshttps://doi.org/10.1109/dac.1995.250000openalex-snapshot
On the Bounded-Skew Clock and Steiner Routing Problems
inferred← citeshttps://doi.org/10.1109/dac.2006.229213openalex-snapshot
Timing-driven Steiner trees are (practically) free
inferred← citeshttps://doi.org/10.1109/dac63849.2025.11133098openalex-snapshot
PatLabor: Pareto Optimization of Timing-Driven Routing Trees
inferred← citeshttps://doi.org/10.1109/ds-rt.2006.29openalex-snapshot
Priority based Overlay Multicast with Filtering Mechanism for Distributed Interactive Applications
inferred← citeshttps://doi.org/10.1109/embc.2018.8512503openalex-snapshot
Graph-Based Models of Cortical Axons for the Prediction of Neuronal Response to Extracellular Electrical Stimulation
inferred← citeshttps://doi.org/10.1109/focs.2004.11openalex-snapshot
An Edge in Time Saves Nine: LP Rounding Approximation Algorithms for Stochastic Network Design
inferred← citeshttps://doi.org/10.1109/focs.2009.41openalex-snapshot
An Oblivious O(1)-Approximation for Single Source Buy-at-Bulk
inferred← citeshttps://doi.org/10.1109/focs.2010.62openalex-snapshot
One Tree Suffices: A Simultaneous O(1)-Approximation for Single-Sink Buy-at-Bulk
inferred← citeshttps://doi.org/10.1109/focs.2011.18openalex-snapshot
Steiner Shallow-Light Trees are Exponentially Lighter than Spanning Ones
inferred← citeshttps://doi.org/10.1109/glocom.2005.1578304openalex-snapshot
A study on combined routing and source coding with explicit side information in sensor networks
inferred← citeshttps://doi.org/10.1109/glocom.2007.173openalex-snapshot
A 2-Approximation Double-Tree Algorithm for Correlated Data Gathering in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/glocomw.2004.1417626openalex-snapshot
An optimal online strategy to increment connection trees
inferred← citeshttps://doi.org/10.1109/glsv.1993.224480openalex-snapshot
Mixed spanning trees: a technique for performance-driven routing
inferred← citeshttps://doi.org/10.1109/iccad.2015.7372556openalex-snapshot
Global routing with inherent static timing constraints
inferred← citeshttps://doi.org/10.1109/iccad.2017.8203828openalex-snapshot
SALT: Provably good routing topology by a novel steiner shallow-light tree algorithm
inferred← citeshttps://doi.org/10.1109/iccad57390.2023.10323981openalex-snapshot
Towards Timing-Driven Routing: An Efficient Learning Based Geometric Approach
inferred← citeshttps://doi.org/10.1109/icccn.1999.805581openalex-snapshot
Provably good approximation to minimum cost delay-constrained multicast trees
inferred← citeshttps://doi.org/10.1109/iccnc.2018.8390239openalex-snapshot
Hierarchical Agglomerative Aggregation Scheduling in Directional Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/icde.2017.112openalex-snapshot
Towards Unified Data and Lifecycle Management for Deep Learning
inferred← citeshttps://doi.org/10.1109/icicic.2007.408openalex-snapshot
Non-deterministic Algorithm for Routing Optimization: A Case Study
inferred← citeshttps://doi.org/10.1109/icme.2004.1394532openalex-snapshot
Distributed construction of resource-efficient overlay tree by approximating MST
inferred← citeshttps://doi.org/10.1109/icspis48872.2019.9066030openalex-snapshot
An Intelligent and Flexible Solution for the Balanced Spanning Tree Problem
inferred← citeshttps://doi.org/10.1109/infcom.2009.5061918openalex-snapshot
Near Optimal Multicriteria Spanner Constructions in Wireless Ad-Hoc Networks
inferred← citeshttps://doi.org/10.1109/infcom.2012.6195659openalex-snapshot
On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approximation algorithms
inferred← citeshttps://doi.org/10.1109/infocom.2008.316openalex-snapshot
Maximizing Resilient Throughput in Peer-to-Peer Network: A Generalized Flow Approach
inferred← citeshttps://doi.org/10.1109/infocom.2014.6848071openalex-snapshot
Improved structures for data collection in wireless sensor networks
inferred← citeshttps://doi.org/10.1109/ipsn.2008.24openalex-snapshot
Joint Routing and 2D Transform Optimization for Irregular Sensor Network Grids Using Wavelet Lifting
inferred← citeshttps://doi.org/10.1109/iscas.1993.394112openalex-snapshot
A direct combination of the Prim and Dijkstra constructions for improved performance-driven global routing
inferred← citeshttps://doi.org/10.1109/iscas.1993.693037openalex-snapshot
A direct combination of the Prim and Dijkstra constructions for improved performance-driven global routing
inferred← citeshttps://doi.org/10.1109/iscas.1995.521486openalex-snapshot
Performance driven routing with multiple sources
inferred← citeshttps://doi.org/10.1109/iscas.1999.780109openalex-snapshot
Balancing Steiner minimum trees and shortest-path trees in the rectilinear plane
inferred← citeshttps://doi.org/10.1109/isit.2005.1523283openalex-snapshot
Balanced aggregation trees for routing correlated data in wireless sensor networks
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/jiot.2016.2642643openalex-snapshot
Multicast Routing for Multimedia Communications in the Internet of Things
inferred← citeshttps://doi.org/10.1109/jsac.2004.836000openalex-snapshot
Multipath Routing for Video Delivery Over Bandwidth-Limited Networks
inferred← citeshttps://doi.org/10.1109/mobhoc.2009.5336961openalex-snapshot
Interference and power constrained Broadcasting and Multicasting in wireless ad hoc networks with directional antennas
inferred← citeshttps://doi.org/10.1109/monetec55448.2022.9960759openalex-snapshot
Flooding Topology Algorithms for Computer Networks
inferred← citeshttps://doi.org/10.1109/monetec55448.2022.9960766openalex-snapshot
Network Convergence Analysis Using Indirect Next Hop Approach
inferred← citeshttps://doi.org/10.1109/paap.2014.52openalex-snapshot
Approximating the Shallow-Light Steiner Tree Problem When Cost and Delay are Linearly Dependent
inferred← citeshttps://doi.org/10.1109/pdcat.2014.17openalex-snapshot
On the Shallow-Light Steiner Tree Problem
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646142openalex-snapshot
Improved approximations for shallow-light spanning trees
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743427openalex-snapshot
The access network design problem
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892328openalex-snapshot
Hierarchical placement and network design problems
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892330openalex-snapshot
Cost-distance: two metric network design
inferred← citeshttps://doi.org/10.1109/sfcs.2001.959915openalex-snapshot
Designing networks incrementally
inferred← citeshttps://doi.org/10.1109/slip.2017.7974908openalex-snapshot
Timing driven routing tree construction
inferred← citeshttps://doi.org/10.1109/tc.2015.2512862openalex-snapshot
On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms
inferred← citeshttps://doi.org/10.1109/tcad.2017.2697964openalex-snapshot
Global Routing With Timing Constraints
inferred← citeshttps://doi.org/10.1109/tcad.2019.2894653openalex-snapshot
SALT: Provably Good Routing Topology by a Novel Steiner Shallow-Light Tree Algorithm
inferred← citeshttps://doi.org/10.1109/tcad.2024.3501932openalex-snapshot
Delay-Driven Rectilinear Steiner Tree Construction
inferred← citeshttps://doi.org/10.1109/tcomm.2003.811420openalex-snapshot
Minimum-cost QoS multicast and unicast routing in communication networks
inferred← citeshttps://doi.org/10.1109/tcomm.2007.894118openalex-snapshot
An Integer-Programming Approach to the Bicriteria Multicasting Problem in Optical Networks
inferred← citeshttps://doi.org/10.1109/tii.2017.2691586openalex-snapshot
Lossless In-Network Processing in WSNs for Domain-Specific Monitoring Applications
inferred← citeshttps://doi.org/10.1109/tmc.2006.154openalex-snapshot
On the Construction of a Strongly Connected Broadcast Arborescence with Bounded Transmission Delay
inferred← citeshttps://doi.org/10.1109/tmc.2007.250667openalex-snapshot
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks
inferred← citeshttps://doi.org/10.1109/tnet.2005.863711openalex-snapshot
Network correlated data gathering with explicit communication: NP-completeness and algorithms
inferred← citeshttps://doi.org/10.1109/tnet.2007.900703openalex-snapshot
Designing Routes for Source Coding With Explicit Side Information in Sensor Networks
inferred← citeshttps://doi.org/10.1109/tnet.2010.2053381openalex-snapshot
Near-Optimal Multicriteria Spanner Constructions in Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/tpds.2009.129openalex-snapshot
Delay-Bounded and Energy-Efficient Composite Event Monitoring in Heterogeneous Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/twc.2017.2724516openalex-snapshot
Lossless In-Network Processing and Its Routing Design in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/wcica.2008.4593942openalex-snapshot
Distributed connected dominating tree algorithm with multiple objective constraints for wireless sensor network
inferred← citeshttps://doi.org/10.1126/scisignal.2001935openalex-snapshot
ANAT: A Tool for Constructing and Analyzing Functional Protein Networks
inferred← citeshttps://doi.org/10.1137/050629665openalex-snapshot
Cost-Distance: Two Metric Network Design
inferred← citeshttps://doi.org/10.1137/08072721xopenalex-snapshot
Designing Network Protocols for Good Equilibria
inferred← citeshttps://doi.org/10.1137/1.9781611974782.38openalex-snapshot
LAST but not Least: Online Spanners for Buy-at-Bulk
inferred← citeshttps://doi.org/10.1137/s0895480199352622openalex-snapshot
Minimizing Wirelength in Zero and Bounded Skew Clock Trees
inferred← citeshttps://doi.org/10.1137/s1052623497321432openalex-snapshot
Approximating the Single-Sink Link-Installation Problem in Network Design
inferred← citeshttps://doi.org/10.1142/s0218195999000194openalex-snapshot
MIXED SPANNING TREES IN THEORY AND PRACTICE
inferred← citeshttps://doi.org/10.1142/s1793830912500383openalex-snapshot
STRONG CONNECTIVITY IN SENSOR NETWORKS WITH GIVEN NUMBER OF DIRECTIONAL ANTENNAE OF BOUNDED ANGLE
inferred← citeshttps://doi.org/10.1145/1023756.1023769openalex-snapshot
Energy-efficient broadcasting in ad-hoc networks
inferred← citeshttps://doi.org/10.1145/1143549.1143710openalex-snapshot
Energy efficient real-time data aggregation in wireless sensor networks
inferred← citeshttps://doi.org/10.1145/1540343.1540349openalex-snapshot
On a locally minimum cost forwarding game
inferred← citeshttps://doi.org/10.1145/2458051.2458057openalex-snapshot
Synchronized distribution framework for high-quality multimodal interactive teleimmersion
inferred← citeshttps://doi.org/10.1145/2629653openalex-snapshot
Minimum Makespan Multi-Vehicle Dial-a-Ride
inferred← citeshttps://doi.org/10.1145/2723372.2749449openalex-snapshot
The Minimum Wiener Connector Problem
inferred← citeshttps://doi.org/10.1145/3225209.3225215openalex-snapshot
A study of optimal cost-skew tradeoff and remaining suboptimality in interconnect tree constructions
inferred← citeshttps://doi.org/10.1145/3382734.3405701openalex-snapshot
Distributed Construction of Light Networks
inferred← citeshttps://doi.org/10.1145/3508352.3549434openalex-snapshot
GPU-Accelerated Rectilinear Steiner Tree Generation
inferred← citeshttps://doi.org/10.1145/3789668openalex-snapshot
MALT: ML Assisted Shallow-Light Tree Construction
inferred← citeshttps://doi.org/10.1145/380752.380827openalex-snapshot
A constant factor approximation for the single sink edge installation problems
inferred← citeshttps://doi.org/10.1155/2011/893592openalex-snapshot
Secure Clustering and Symmetric Key Establishment in Heterogeneous Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1287/moor.1060.0237openalex-snapshot
LP Rounding Approximation Algorithms for Stochastic Network Design
inferred← citeshttps://doi.org/10.1287/moor.2015.0729openalex-snapshot
Capacitated Vehicle Routing with Nonuniform Speeds
inferred← citeshttps://doi.org/10.1371/journal.pcbi.1000711openalex-snapshot
Neocortical Axon Arbors Trade-off Material and Conduction Delay Conservation
inferred← citeshttps://doi.org/10.14279/depositonce-3968openalex-snapshot
Network flows and network design in theory and practice
inferred← citeshttps://doi.org/10.14778/2824032.2824035openalex-snapshot
Principles of dataset versioning
inferred← citeshttps://doi.org/10.1504/ijsnet.2008.019251openalex-snapshot
Energy-efficient data gathering algorithm in sensor networks with partial aggregation
showing the first 200 of 229 · page through all 229
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.