Imagen de Portada

Designing Capacitated Subnetworks for Shortest Path Routing

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Chimani, Markus, Ilsen, Max
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms Networking and Internet Architecture 68M10 (Primary) 05C85, 90-05 (Secondary) C.2.1; G.2.2; F.2.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Traffic-Oblivious Multi-Commodity Flow Network Design
por: Chimani, Markus, et al.
Publicado: (2025)

Directed Capacity-Preserving Subgraphs: Hardness and Exact Polynomial Algorithms
por: Chimani, Markus, et al.
Publicado: (2023)

No Traffic to Cry: Traffic-Oblivious Link Deactivation for Green Traffic Engineering
por: Ilsen, Max, et al.
Publicado: (2026)

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
por: Chimani, Markus, et al.
Publicado: (2021)

Simple Approximations for General Spanner Problems
por: Bökler, Fritz, et al.
Publicado: (2025)

Exact Minimum Weight Spanners via Column Generation
por: Bökler, Fritz, et al.
Publicado: (2024)

Shortest two disjoint paths in conservative graphs
por: Schlotter, Ildikó
Publicado: (2023)

Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing
por: Krishnaswamy, Ravishankar, et al.
Publicado: (2014)

On the Complexity of the Bilevel Shortest Path Problem
por: Henke, Dorothee, et al.
Publicado: (2024)

Exact Algorithms for MaxCut on Split Graphs
por: Lalovic, Marko
Publicado: (2024)

Fully Dynamic Breadth First Search and Spanning Trees in Directed Graphs
por: Morse, Gregory, et al.
Publicado: (2026)

Low Recourse Arborescence Forests Under Uniformly Random Arcs
por: Dahlmeier, J Niklas, et al.
Publicado: (2025)

Approximating Graphic Multi-Path TSP and Graphic Ordered TSP
por: Alimi, Morteza, et al.
Publicado: (2025)

Tree-independence number VI. Thetas and pyramids
por: Chudnovsky, Maria, et al.
Publicado: (2025)

How Local Separators Shape Community Structure in Large Networks
por: Frenkel, Sarah, et al.
Publicado: (2025)

Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation
por: Hommelsheim, Felix
Publicado: (2025)

How quickly can you pack short paths? Engineering a search-tree algorithm for disjoint s-t paths of bounded length
por: Huber, Michael Kiran
Publicado: (2024)

Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time
por: Gartland, Peter, et al.
Publicado: (2023)

Finding Diverse Minimum s-t Cuts
por: de Berg, Mark, et al.
Publicado: (2023)

A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
por: Rockel-Wolff, Benjamin
Publicado: (2024)

Discounted Cuts: A Stackelberg Approach to Network Disruption
por: Drange, Pål Grønås, et al.
Publicado: (2025)

Steiner Tree Parameterized by Multiway Cut and Even Less
por: Jansen, Bart M. P., et al.
Publicado: (2024)

A Constant-factor Approximation for Weighted Bond Cover
por: Kim, Eun Jung, et al.
Publicado: (2021)

Exploration of $k$-edge-deficient temporal graphs in linear time
por: Lahtin, Ivan, et al.
Publicado: (2026)

Optimal Path Partitions in Subcubic and Almost-subcubic Graphs
por: Masařík, Tomáš, et al.
Publicado: (2026)

A $4/3$ Approximation for $2$-Vertex-Connectivity
por: Bosch-Calvo, Miguel, et al.
Publicado: (2023)

Bicriteria Submodular Maximization
por: Feldman, Moran, et al.
Publicado: (2025)

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
por: Buchbinder, Niv, et al.
Publicado: (2024)

On the Relation Between Treewidth, Tree-Independence Number, and Tree-Chromatic Number of Graphs
por: Koutsoutis, Alex, et al.
Publicado: (2025)

Optimal Bounds for the k-Disjoint Paths Problem
por: Cavallaro, Dario, et al.
Publicado: (2026)

ARRIVAL: Recursive Framework & $\ell_1$-Contraction
por: Haslebacher, Sebastian
Publicado: (2025)

Temporalizing digraphs via linear-size balanced bi-trees
por: Bessy, Stéphane, et al.
Publicado: (2023)

Identification to Subclasses of Chordal Graphs
por: Golovach, Petr A., et al.
Publicado: (2026)

A $5/4$-Approximation for Two-Edge Connectivity
por: Bosch-Calvo, Miguel, et al.
Publicado: (2024)

Decline and Fall of the ICALP 2008 Modular Decomposition algorithm
por: Atherton, William, et al.
Publicado: (2024)

Dynamic programming on bipartite tree decompositions
por: Jaffke, Lars, et al.
Publicado: (2023)

Graph modification of bounded size to minor-closed classes as fast as vertex deletion
por: Morelle, Laure, et al.
Publicado: (2025)

A practical algorithm for 2-admissibility
por: Awofeso, Christine, et al.
Publicado: (2025)

Fully Dynamic Maintenance of Loop Nesting Forests in Reducible Flow Graphs
por: Morse, Gregory, et al.
Publicado: (2026)

Finding irrelevant vertices in linear time on bounded-genus graphs
por: Golovach, Petr A., et al.
Publicado: (2019)