On the public citation graph
Approximability of unsplittable shortest path routing problems
0 signed · 57 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/dac.551openalex-snapshot
Multi‐hour design of survivable classical IP networks
inferredcites →https://doi.org/10.1002/net.10102openalex-snapshot
Optimization of Internet Protocol network design and routing
inferredcites →https://doi.org/10.1002/net.20070openalex-snapshot
A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
inferredcites →https://doi.org/10.1002/net.20163openalex-snapshot
Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
inferredcites →https://doi.org/10.1007/11496915_8openalex-snapshot
On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem
inferredcites →https://doi.org/10.1007/3-540-47867-1_33openalex-snapshot
The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap
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-540-77903-2_2openalex-snapshot
Routing and Capacity Optimization for IP Networks
inferredcites →https://doi.org/10.1007/978-3-540-79409-7_7openalex-snapshot
Integer Programming Approaches to Access and Backbone IP Network Planning
inferredcites →https://doi.org/10.1007/978-3-540-87744-8_17openalex-snapshot
An Integer Programming Algorithm for Routing Optimization in IP Networks
inferredcites →https://doi.org/10.1007/978-3-642-58412-1openalex-snapshot
Complexity and Approximation
inferredcites →https://doi.org/10.1007/bf02110141openalex-snapshot
An optimization problem related to balancing loads on SONET rings
inferredcites →https://doi.org/10.1007/s004930050043openalex-snapshot
On the Single-Source Unsplittable Flow Problem
inferredcites →https://doi.org/10.1007/s101070100260openalex-snapshot
Approximating the single source unsplittable min-cost flow problem
inferredcites →https://doi.org/10.1016/b978-0-12-557189-0.x5000-8openalex-snapshot
Routing, Flow, and Capacity Design in Communication and Computer Networks
inferredcites →https://doi.org/10.1016/s0166-218x(02)00235-4openalex-snapshot
Inverse optimization in high-speed networks
inferredcites →https://doi.org/10.1023/a:1014852026591openalex-snapshot
A Genetic Algorithm for the Weight Setting Problem in OSPF Routing
inferredcites →https://doi.org/10.1023/b:coap.0000039487.35027.02openalex-snapshot
Increasing Internet Capacity Using Local Search
inferredcites →https://doi.org/10.1109/focs.2004.32openalex-snapshot
Hardness of Buy-at-Bulk Network Design
inferredcites →https://doi.org/10.1109/icc.1993.397358openalex-snapshot
Minimax open shortest path first routing algorithms in networks supporting the SMDS service
inferredcites →https://doi.org/10.1109/infcom.2000.832225openalex-snapshot
Internet traffic engineering by optimizing OSPF weights
inferredcites →https://doi.org/10.1109/sfcs.1997.646131openalex-snapshot
Improved approximation algorithms for unsplittable flow problems
inferredcites →https://doi.org/10.1109/sfcs.1998.743488openalex-snapshot
Approximating a finite metric by a small number of tree metrics
inferredcites →https://doi.org/10.1109/sfcs.2000.892330openalex-snapshot
Cost-distance: two metric network design
inferredcites →https://doi.org/10.1137/s0097539793242618openalex-snapshot
A General Approximation Technique for Constrained Forest Problems
inferredcites →https://doi.org/10.1137/s0895480100377428openalex-snapshot
Internet Routing and Related Topology Issues
inferredcites →https://doi.org/10.1145/1060590.1060617openalex-snapshot
On non-uniform multicommodity buy-at-bulk network design
inferredcites →https://doi.org/10.1145/276698.276725openalex-snapshot
On approximating arbitrary metrices by tree metrics
inferredcites →https://doi.org/10.1145/301250.301447openalex-snapshot
Design networks with bounded pairwise distance
inferredcites →https://doi.org/10.1145/380752.380827openalex-snapshot
A constant factor approximation for the single sink edge installation problems
inferredcites →https://doi.org/10.1145/780542.780597openalex-snapshot
Simpler and better approximation algorithms for network design
inferredcites →https://doi.org/10.1145/780542.780608openalex-snapshot
A tight bound on approximating arbitrary metrics by tree metrics
inferredcites →https://doi.org/10.17487/rfc1195openalex-snapshot
Use of OSI IS-IS for routing in TCP/IP and dual environments
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.21612openalex-snapshot
On the complexity of equal shortest path routing
inferred← citeshttps://doi.org/10.1007/978-3-030-86514-6_30openalex-snapshot
Monte Carlo Search Algorithms for Network Traffic Engineering
inferred← citeshttps://doi.org/10.1007/978-3-319-07956-1_13openalex-snapshot
A Hybrid Genetic Algorithm for Solving the Unsplittable Multicommodity Flow Problem: The Maritime Surveillance Case
inferred← citeshttps://doi.org/10.1007/978-3-319-09129-7_20openalex-snapshot
A Multi-start Tabu Search Approach for Solving the Information Routing Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-02250-0_8openalex-snapshot
Optimization of OSPF Routing in IP Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-32711-7_2openalex-snapshot
A Genetic Algorithm for a Joint Routing and Scheduling Problem in Heterogeneous Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-38610-7_49openalex-snapshot
Towards Efficient Information Exchange in Fusion Networks
inferred← citeshttps://doi.org/10.1007/s00453-009-9381-5openalex-snapshot
An Integer Programming Algorithm for Routing Optimization in IP Networks
inferred← citeshttps://doi.org/10.1007/s10489-016-0776-0openalex-snapshot
Fuzzy particle swarm optimization algorithms for the open shortest path first weight setting problem
inferred← citeshttps://doi.org/10.1007/s12597-023-00718-0openalex-snapshot
An enhanced Benders decomposition method for unique shortest path routing
inferred← citeshttps://doi.org/10.1016/j.amc.2014.10.123openalex-snapshot
A multi-start variable neighborhood search for solving the single path multicommodity flow problem
inferred← citeshttps://doi.org/10.1016/j.comnet.2015.09.003openalex-snapshot
Optimal design of Information Centric Networks
inferred← citeshttps://doi.org/10.1057/s41274-016-0144-9openalex-snapshot
An origin-based model for unique shortest path routing
inferred← citeshttps://doi.org/10.1109/codit58514.2023.10284215openalex-snapshot
Unsplittable Shortest Path Routing: Extended Model and Matheuristic
inferred← citeshttps://doi.org/10.1109/codit66093.2025.11321356openalex-snapshot
Explainable optimized solution for the IGP weight design problem
inferred← citeshttps://doi.org/10.1109/dasc-picom-datacom-cyberscitec.2017.184openalex-snapshot
Incremental Hybrid SDN Deployment for Enterprise Networks
inferred← citeshttps://doi.org/10.1109/tnsm.2021.3090312openalex-snapshot
On the Implications of Routing Models on Network Optimization
inferred← citeshttps://doi.org/10.1109/tnsm.2021.3135122openalex-snapshot
Hybrid Incremental Deployment of HSDN Devices
inferred← citeshttps://doi.org/10.1109/wmnc.2011.6097256openalex-snapshot
An ant colony optimization metaheuristic for solving bi-objective multi-sources multicommodity communication flow problem
inferred← citeshttps://doi.org/10.1111/itor.12378openalex-snapshot
Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem
inferred← citeshttps://doi.org/10.70675/d0c45cedz37d5z459ez94a9z1cc878aa2b8copenalex-snapshot
Efficient in-network content distribution : wireless resource sharing, network planning, and security
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.