Imagen de Portada

Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Dai, Wenkai, Dinitz, Michael, Foerster, Klaus-Tycho, Luo, Long, Schmid, Stefan
Formato:	Preprint
Publicado:	2024
Materias:	Performance Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Approximation Algorithms for Optimal Hopsets
por: Dinitz, Michael, et al.
Publicado: (2025)

A Separation Between Optimal Demand-Oblivious and Demand-Aware Network Throughput
por: Bentert, Matthias, et al.
Publicado: (2026)

Anonymized Network Sensing Graph Challenge
por: Jananthan, Hayden, et al.
Publicado: (2024)

Efficient set-theoretic algorithms for computing high-order Forman-Ricci curvature on abstract simplicial complexes
por: de Souza, Danillo Barros, et al.
Publicado: (2023)

Improving the Graph Challenge Reference Implementation
por: Voloshchuk, Inna, et al.
Publicado: (2026)

Approximation of Spanning Tree Congestion using Hereditary Bisection
por: Kolman, Petr
Publicado: (2024)

Light Edge Fault Tolerant Graph Spanners
por: Bodwin, Greg, et al.
Publicado: (2025)

Efficient Algorithms for Minimizing the Kirchhoff Index via Adding Edges
por: Zhou, Xiaotian, et al.
Publicado: (2025)

Optimizing LoRa for Edge Computing with TinyML Pipeline for Channel Hopping
por: Grunewald, Marla, et al.
Publicado: (2024)

Staff Scheduling for Demand-Responsive Services
por: Manik, Debsankha, et al.
Publicado: (2024)

Efficient Computation in Congested Anonymous Dynamic Networks
por: Di Luna, Giuseppe A., et al.
Publicado: (2023)

Approximating the Network Design Problem for Potential-Based Flows
por: Klimm, Max, et al.
Publicado: (2026)

Finding Minimal Clusters in st-DAGs
por: Vogl, Ulrich, et al.
Publicado: (2026)

Approximate weighted 3-coloring
por: Erzin, Adil, et al.
Publicado: (2025)

Minimizing breaks by minimizing odd cycle transversals
por: Fujii, Koichi, et al.
Publicado: (2024)

Application of the Quantum Approximate Optimization Algorithm in Solving the Total Domination Problem
por: Pan, Haoqian, et al.
Publicado: (2024)

The Power of Amortization on Minimizing Total Completion Time with Explorable Uncertainty
por: Krekelberg, Bob, et al.
Publicado: (2025)

An Approximation Algorithm for Monotone Submodular Cost Allocation
por: Mizutani, Ryuhei
Publicado: (2025)

Approximation algorithms for job scheduling with block-type conflict graphs
por: Furmańczyk, Hanna, et al.
Publicado: (2022)

Word-representability and comparability: Minimal forbidden induced subgraphs and cover number bounds
por: Kenkireth, Benny George, et al.
Publicado: (2025)

Sparse Approximation in Lattices and Semigroups
por: Kuhlmann, Stefan, et al.
Publicado: (2024)

On the Resilience of Fast Failover Routing Against Dynamic Link Failures
por: Dai, Wenkai, et al.
Publicado: (2024)

Algorithms for the Global Domination Problem
por: Inza, Ernesto Parra, et al.
Publicado: (2023)

Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
por: Wang, Chen, et al.
Publicado: (2024)

A Constant-Approximation Algorithm for Budgeted Sweep Coverage with Mobile Sensors
por: Liang, Wei, et al.
Publicado: (2024)

Approximation Algorithms for the $b$-Matching and List-Restricted Variants of MaxQAP
por: Nanta, Jiratchaphat, et al.
Publicado: (2025)

On Construction of Approximate Real Mutually Unbiased Bases for an infinite class of dimensions $d \not\equiv 0 \bmod 4$
por: Kumar, Ajeet, et al.
Publicado: (2025)

Boolean Functions with Small Approximate Spectral Norm
por: Cheung, Tsun-Ming, et al.
Publicado: (2024)

An Algorithm for the Decomposition of Complete Graph into Minimum Number of Edge-disjoint Trees
por: Sinha, Antika, et al.
Publicado: (2024)

Atomic Column Generation For Consensus Between Algorithms: Application to Path Computation
por: Martin, Sébastien, et al.
Publicado: (2025)

Approximating temporal modularity on graphs of small underlying treewidth
por: Agdur, Vilhelm, et al.
Publicado: (2025)

Stable Approximation Algorithms for Dominating Set and Independent Set
por: de Berg, Mark, et al.
Publicado: (2024)

Who Should Have a Place on the Ark? Parameterized Algorithms for the Maximization of Phylogenetic Diversity
por: Schestag, Jannik
Publicado: (2025)

A Sublinear Algorithm for Approximate Shortest Paths in Large Networks
por: Basu, Sabyasachi, et al.
Publicado: (2024)

Are Graph Neural Networks Optimal Approximation Algorithms?
por: Yau, Morris, et al.
Publicado: (2023)

Demystifying the RSA Algorithm: An Intuitive Introduction for Novices in Cybersecurity
por: Luo, Zhengping Jay, et al.
Publicado: (2023)

The Storage Location Assignment and Picker Routing Problem: A Generic Branch-Cut-and-Price Algorithm
por: Prunet, Thibault, et al.
Publicado: (2024)

Enumerating Minimal Defensive Alliances
por: Feng, Zhidan, et al.
Publicado: (2023)

A Polynomial-Time Approximation Algorithm for Complete Interval Minors
por: Bourneuf, Romain, et al.
Publicado: (2025)

Approximate polymorphisms of predicates
por: Alekseev, Yaroslav, et al.
Publicado: (2025)