A Differentiable Digital Twin of Distributed Link Scheduling for Contention-Aware Networking
Fuente:
arXiv
Saved in:
| Main Authors: | Zhao, Zhongyuan, Ming, Yujun, Chan, Kevin, Swami, Ananthram, Segarra, Santiago |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing
by: Krishnaswamy, Ravishankar, et al.
Published: (2014)
by: Krishnaswamy, Ravishankar, et al.
Published: (2014)
Traffic-Oblivious Multi-Commodity Flow Network Design
by: Chimani, Markus, et al.
Published: (2025)
by: Chimani, Markus, et al.
Published: (2025)
Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
by: Choi, Mujin, et al.
Published: (2025)
by: Choi, Mujin, et al.
Published: (2025)
Quickly excluding an annotated planar graph
by: Gorsky, Maximilian, et al.
Published: (2026)
by: Gorsky, Maximilian, et al.
Published: (2026)
The price of homogeneity is polynomial
by: Gorsky, Maximilian, et al.
Published: (2026)
by: Gorsky, Maximilian, et al.
Published: (2026)
Paired 2-disjoint path covers of Bcube under the partitioned edge fault model
by: Zhang, Wenjing, et al.
Published: (2025)
by: Zhang, Wenjing, et al.
Published: (2025)
No Traffic to Cry: Traffic-Oblivious Link Deactivation for Green Traffic Engineering
by: Ilsen, Max, et al.
Published: (2026)
by: Ilsen, Max, et al.
Published: (2026)
Asymptotic probability of irreducibles II: sequence
by: Monteil, Thierry, et al.
Published: (2025)
by: Monteil, Thierry, et al.
Published: (2025)
A Constant-factor Approximation for Weighted Bond Cover
by: Kim, Eun Jung, et al.
Published: (2021)
by: Kim, Eun Jung, et al.
Published: (2021)
On the Average-Case Performance of Greedy for Maximum Coverage
by: Balkanski, Eric, et al.
Published: (2026)
by: Balkanski, Eric, et al.
Published: (2026)
Polynomial Bounds for the Graph Minor Structure Theorem
by: Gorsky, Maximilian, et al.
Published: (2025)
by: Gorsky, Maximilian, et al.
Published: (2025)
A Community-Aware Framework for Influence Maximization with Explicit Accounting for Inter-Community Influence
by: Robson, Eliot W., et al.
Published: (2025)
by: Robson, Eliot W., et al.
Published: (2025)
DAG Scheduling in the BSP Model
by: Papp, Pál András, et al.
Published: (2023)
by: Papp, Pál András, et al.
Published: (2023)
Shortest two disjoint paths in conservative graphs
by: Schlotter, Ildikó
Published: (2023)
by: Schlotter, Ildikó
Published: (2023)
An Improved Drift Theorem for Balanced Allocations
by: Los, Dimitrios, et al.
Published: (2023)
by: Los, Dimitrios, et al.
Published: (2023)
Optimal Bounds for the k-Disjoint Paths Problem
by: Cavallaro, Dario, et al.
Published: (2026)
by: Cavallaro, Dario, et al.
Published: (2026)
Modularity of preferential attachment graphs
by: Rybarczyk, Katarzyna, et al.
Published: (2025)
by: Rybarczyk, Katarzyna, et al.
Published: (2025)
Asymptotics for graphically divergent series: dense digraphs and 2-SAT formulae
by: Dovgal, Sergey, et al.
Published: (2023)
by: Dovgal, Sergey, et al.
Published: (2023)
Metrics on Permutation Families Defined by a Restriction Graph
by: Tymoshenko, Danylo, et al.
Published: (2025)
by: Tymoshenko, Danylo, et al.
Published: (2025)
Counting Kernels in Directed Graphs with Arbitrary Orientations
by: Jartoux, Bruno
Published: (2022)
by: Jartoux, Bruno
Published: (2022)
New results on graph matching from degree preserving growth
by: Erdős, Péter L., et al.
Published: (2022)
by: Erdős, Péter L., et al.
Published: (2022)
Caterpillar GNN: Replacing Message Passing with Efficient Aggregation
by: Černý, Marek
Published: (2025)
by: Černý, Marek
Published: (2025)
Exploration of $k$-edge-deficient temporal graphs in linear time
by: Lahtin, Ivan, et al.
Published: (2026)
by: Lahtin, Ivan, et al.
Published: (2026)
On the Relation Between Treewidth, Tree-Independence Number, and Tree-Chromatic Number of Graphs
by: Koutsoutis, Alex, et al.
Published: (2025)
by: Koutsoutis, Alex, et al.
Published: (2025)
ARRIVAL: Recursive Framework & $\ell_1$-Contraction
by: Haslebacher, Sebastian
Published: (2025)
by: Haslebacher, Sebastian
Published: (2025)
The Distributional Tail of Worst-Case Quickselect
by: Płecha, Witold
Published: (2026)
by: Płecha, Witold
Published: (2026)
Killing a Vortex
by: Thilikos, Dimitrios M., et al.
Published: (2022)
by: Thilikos, Dimitrios M., et al.
Published: (2022)
How Local Separators Shape Community Structure in Large Networks
by: Frenkel, Sarah, et al.
Published: (2025)
by: Frenkel, Sarah, et al.
Published: (2025)
On the MST-ratio: Theoretical Bounds and Complexity of Finding the Maximum
by: Ameli, Afrouz Jabal, et al.
Published: (2024)
by: Ameli, Afrouz Jabal, et al.
Published: (2024)
On the Diameter of Arrangements of Topological Disks
by: Abiad, Aida, et al.
Published: (2025)
by: Abiad, Aida, et al.
Published: (2025)
Bipartite Turán problem on cographs
by: Zimmermann, Jakob Paul
Published: (2026)
by: Zimmermann, Jakob Paul
Published: (2026)
A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
by: Rockel-Wolff, Benjamin
Published: (2024)
by: Rockel-Wolff, Benjamin
Published: (2024)
A Pressure-Based Diffusion Model for Influence Maximization on Social Networks
by: Stutsman, Curt, et al.
Published: (2025)
by: Stutsman, Curt, et al.
Published: (2025)
Homomorphism Tensors and Linear Equations
by: Grohe, Martin, et al.
Published: (2021)
by: Grohe, Martin, et al.
Published: (2021)
Fractional Budget Allocation for Influence Maximization under General Marketing Strategies
by: Bhimaraju, Akhil, et al.
Published: (2024)
by: Bhimaraju, Akhil, et al.
Published: (2024)
Directed Capacity-Preserving Subgraphs: Hardness and Exact Polynomial Algorithms
by: Chimani, Markus, et al.
Published: (2023)
by: Chimani, Markus, et al.
Published: (2023)
Hyperstability in the Erdős-Sós Conjecture
by: Pokrovskiy, Alexey
Published: (2024)
by: Pokrovskiy, Alexey
Published: (2024)
Temporalizing digraphs via linear-size balanced bi-trees
by: Bessy, Stéphane, et al.
Published: (2023)
by: Bessy, Stéphane, et al.
Published: (2023)
Exact Algorithms for MaxCut on Split Graphs
by: Lalovic, Marko
Published: (2024)
by: Lalovic, Marko
Published: (2024)
The Directed Disjoint Paths Problem with Congestion
by: Bentert, Matthias, et al.
Published: (2025)
by: Bentert, Matthias, et al.
Published: (2025)
Similar Items
-
Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing
by: Krishnaswamy, Ravishankar, et al.
Published: (2014) -
Traffic-Oblivious Multi-Commodity Flow Network Design
by: Chimani, Markus, et al.
Published: (2025) -
Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
by: Choi, Mujin, et al.
Published: (2025) -
Quickly excluding an annotated planar graph
by: Gorsky, Maximilian, et al.
Published: (2026) -
The price of homogeneity is polynomial
by: Gorsky, Maximilian, et al.
Published: (2026)