On the public citation graph

Optimal oblivious routing in polynomial time

0 signed · 61 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.1007/bf02579324openalex-snapshot
Randomized rounding: A technique for provably good algorithms and algorithmic proofs
inferredcites →https://doi.org/10.1016/0022-0000(85)90008-xopenalex-snapshot
Routing, merging, and sorting on parallel models of computation
inferredcites →https://doi.org/10.1057/jors.1989.134openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1109/sfcs.1994.365690openalex-snapshot
Local optimization of global objectives: competitive distributed deadlock resolution and resource allocation
inferredcites →https://doi.org/10.1109/sfcs.2002.1181881openalex-snapshot
Minimizing congestion in general networks
inferredcites →https://doi.org/10.1145/258128.258201openalex-snapshot
On-line routing of virtual circuits with applications to load balancing and machine scheduling
inferredcites →https://doi.org/10.1145/3749740.3749751openalex-snapshot
Universal Schemes for Parallel Communication
inferredcites →https://doi.org/10.1145/633025.633039openalex-snapshot
Measuring ISP topologies with rocketfuel
inferredcites →https://doi.org/10.1145/777412.777418openalex-snapshot
A practical algorithm for constructing oblivious routing schemes
inferredcites →https://doi.org/10.1145/777412.777419openalex-snapshot
A polynomial-time tree decomposition to minimize congestion
inferredcites →https://doi.org/10.1145/777412.777420openalex-snapshot
Online oblivious routing
inferredcites →https://doi.org/10.1145/863955.863991openalex-snapshot
Making intra-domain routing robust to changing and uncertain traffic demands
inferredcites →https://doi.org/10.1145/97444.97453openalex-snapshot
Tight bounds for oblivious routing in the hypercube

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.20165openalex-snapshot
Hardness of robust network design
inferred← citeshttps://doi.org/10.1002/net.21999openalex-snapshot
An efficient approach to optimization of semi‐stable routing in multicommodity flow networks
inferred← citeshttps://doi.org/10.1002/net.22070openalex-snapshot
Affine routing for robust network design
inferred← citeshttps://doi.org/10.1007/978-0-387-79361-0_5openalex-snapshot
Advances in Oblivious Routing of Internet Traffic
inferred← citeshttps://doi.org/10.1007/978-3-642-02250-0_10openalex-snapshot
Permutation Routing and (ℓ, k)-Routing on Plane Grids
inferred← citeshttps://doi.org/10.1007/978-3-642-14031-0_52openalex-snapshot
Threshold Rules for Online Sample Selection
inferred← citeshttps://doi.org/10.1007/978-3-642-30376-0_7openalex-snapshot
Hybrid Demand Oblivious Routing: Hyper-cubic Partitions and Theoretical Upper Bounds
inferred← citeshttps://doi.org/10.1007/978-3-642-32820-6_41openalex-snapshot
Towards Load Balanced Distributed Transactional Memory
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_8openalex-snapshot
Serving in the Dark should be done Non-Uniformly
inferred← citeshttps://doi.org/10.1007/s11036-008-0033-9openalex-snapshot
Optimal Routing for Wireless Mesh Networks With Dynamic Traffic Demand
inferred← citeshttps://doi.org/10.1007/s11235-024-01185-8openalex-snapshot
IoT traffic management using deep learning based on osmotic cloud to edge computing
inferred← citeshttps://doi.org/10.1016/j.comnet.2009.04.016openalex-snapshot
Augmenting predictive with oblivious routing for wireless mesh networks under traffic uncertainty
inferred← citeshttps://doi.org/10.1016/j.jpdc.2015.02.002openalex-snapshot
A load balanced directory for distributed shared memory objects
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.01.026openalex-snapshot
On the approximability of robust network design
inferred← citeshttps://doi.org/10.1109/access.2020.3041765openalex-snapshot
Machine Learning Meets Communication Networks: Current Trends and Future Challenges
inferred← citeshttps://doi.org/10.1109/hpsr.2010.5580267openalex-snapshot
Oblivious routing and QoS guarantee in wireless mesh networks
inferred← citeshttps://doi.org/10.1109/icc.2008.559openalex-snapshot
Oblivious Routing for Wireless Mesh Networks
inferred← citeshttps://doi.org/10.1109/icdcs.2010.77openalex-snapshot
CONTRACT: Incorporating Coordination into the IP Network Control Plane
inferred← citeshttps://doi.org/10.1109/icnp52444.2021.9651930openalex-snapshot
Is Machine Learning Ready for Traffic Engineering Optimization?
inferred← citeshttps://doi.org/10.1109/infcom.2010.5461925openalex-snapshot
Demand-Oblivious Routing: Distributed vs. Centralized Approaches
inferred← citeshttps://doi.org/10.1109/infocom59046.2026.11571662openalex-snapshot
No Traffic to Cry: Traffic-Oblivious Link Deactivation for Green Traffic Engineering
inferred← citeshttps://doi.org/10.1109/mobhoc.2007.4428657openalex-snapshot
Throughput Optimization Routing Under Uncertain Demand for Wireless Mesh Networks
inferred← citeshttps://doi.org/10.1109/nabic.2009.5393819openalex-snapshot
Optimization of routing algorithm in wireless mesh networks
inferred← citeshttps://doi.org/10.1109/sahcn.2008.35openalex-snapshot
Predictive or Oblivious: A Comparative Study of Routing Strategies for Wireless Mesh Networks under Uncertain Demand
inferred← citeshttps://doi.org/10.1109/tccn.2023.3235719openalex-snapshot
MAGNNETO: A Graph Neural Network-Based Multi-Agent System for Traffic Engineering
inferred← citeshttps://doi.org/10.1109/tmc.2023.3235446openalex-snapshot
Routing Optimization With Deep Reinforcement Learning in Knowledge Defined Networking
inferred← citeshttps://doi.org/10.1109/tnet.2024.3485919openalex-snapshot
Dynamic Entanglement Routing Based on Stream Processing for Quantum Networks
inferred← citeshttps://doi.org/10.1109/ucet.2019.8881852openalex-snapshot
A Survey on Deep Learning for the Routing Layer of Computer Network
inferred← citeshttps://doi.org/10.1137/100787337openalex-snapshot
Vertex Sparsification and Oblivious Reductions
inferred← citeshttps://doi.org/10.1137/100796820openalex-snapshot
The All-or-Nothing Multicommodity Flow Problem
inferred← citeshttps://doi.org/10.1137/100802888openalex-snapshot
Set Covering with Our Eyes Closed
inferred← citeshttps://doi.org/10.1137/21m1443467openalex-snapshot
Hop-Constrained Oblivious Routing
inferred← citeshttps://doi.org/10.1137/22m1541800openalex-snapshot
The Power of Two Choices in Graphical Allocation
inferred← citeshttps://doi.org/10.1142/s0219265909002431openalex-snapshot
(ℓ, k)-ROUTING ON PLANE GRIDS
inferred← citeshttps://doi.org/10.1142/s1793830910000929openalex-snapshot
THRESHOLD RULES FOR ONLINE SAMPLE SELECTION
inferred← citeshttps://doi.org/10.1145/1324215.1324235openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1145/1324215.1324236openalex-snapshot
Routing and network design with robustness to changing or uncertain traffic demands
inferred← citeshttps://doi.org/10.1145/1374376.1374440openalex-snapshot
The VPN conjecture is true
inferred← citeshttps://doi.org/10.1145/3229584.3229587openalex-snapshot
Empowering Self-Driving Networks
inferred← citeshttps://doi.org/10.1145/3406325.3451098openalex-snapshot
Hop-constrained oblivious routing
inferred← citeshttps://doi.org/10.1145/3519935.3519995openalex-snapshot
The power of two choices in graphical allocation
inferred← citeshttps://doi.org/10.1145/3749740.3749758openalex-snapshot
Routing to Random Intermediate Destinations
inferred← citeshttps://doi.org/10.1145/863989.863991openalex-snapshot
Making intra-domain routing robust to changing and uncertain traffic demands
inferred← citeshttps://doi.org/10.1155/2022/4560072openalex-snapshot
Comparative Analysis of Routing Schemes Based on Machine Learning
inferred← citeshttps://doi.org/10.1287/moor.1070.0280openalex-snapshot
Domination Between Traffic Matrices
inferred← citeshttps://doi.org/10.14569/ijacsa.2014.050116openalex-snapshot
On A New Competitive Measure For Oblivious Routing
inferred← citeshttps://doi.org/10.4018/978-1-5225-7146-9.ch007openalex-snapshot
Future Networks
inferred← citeshttps://doi.org/10.4018/978-1-7998-7708-0.ch028openalex-snapshot
Future Networks
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.