Image de couverture de livre

Weighted Emulators with Local Heaviest Edges Stretch for Undirected Graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Roditty, Liam, Sapir, Ariel
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms F.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Additive, Near-Additive, and Multiplicative Approximations for APSP in Weighted Undirected Graphs: Trade-offs and Algorithms
par: Roditty, Liam, et autres
Publié: (2025)

On the Online Weighted Non-Crossing Matching Problem
par: Boyar, Joan, et autres
Publié: (2026)

Minimizing the Weighted Makespan with Restarts on a Single Machine
par: Amouzandeh, Aflatoun, et autres
Publié: (2025)

Approximating Maximum Cut on Interval Graphs and Split Graphs beyond Goemans-Williamson
par: Ahn, Jungho, et autres
Publié: (2025)

On Hardness and Approximation of Broadcasting in Structured Graphs
par: Bringolf, Jeffrey, et autres
Publié: (2025)

Colorful Vertex Recoloring of Bipartite Graphs
par: Patt-Shamir, Boaz, et autres
Publié: (2025)

Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs
par: Chuzhoy, Julia, et autres
Publié: (2025)

Graph Threading
par: Demaine, Erik D., et autres
Publié: (2023)

Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs
par: Mosenzon, Ron
Publié: (2025)

Sorting and Ranking of Self-Delimiting Numbers with Applications to Outerplanar Graph Isomorphism
par: Kammer, Frank, et autres
Publié: (2020)

Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures
par: Hommelsheim, Felix, et autres
Publié: (2025)

Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs
par: Balzotti, Lorenzo
Publié: (2020)

Approximate Minimum Sum Colorings and Maximum $k$-Colorable Subgraphs of Chordal Graphs
par: DeHaan, Ian, et autres
Publié: (2024)

Finding All Bounded-Length Simple Cycles in a Directed Graph -- Revisited
par: Bauernöppel, Frank, et autres
Publié: (2025)

Near-Linear Time Computation of Welzl Orders on Graphs with Linear Neighborhood Complexity
par: Dreier, Jan, et autres
Publié: (2026)

Multiplication of 0-1 matrices via clustering
par: Jansson, Jesper, et autres
Publié: (2025)

Fast approximate $\ell$-center clustering in high dimensional spaces
par: Kowaluk, Mirosław, et autres
Publié: (2025)

Offline green bin packing and its constrained variant
par: Gong, Mingyang, et autres
Publié: (2026)

The cost of cyclic permutations and remainder sums in the Euclidean algorithm
par: Blomer, Valentin, et autres
Publié: (2026)

A Faster Directed Single-Source Shortest Path Algorithm
par: Duan, Ran, et autres
Publié: (2026)

Search and evacuation with a near majority of faulty agents
par: Czyzowicz, J., et autres
Publié: (2026)

Tight Bounds for some W[1]-hard Problems Parameterized by Multi-clique-width
par: Bergougnoux, Benjamin, et autres
Publié: (2026)

A $2$-branching construction for the $χ\leq 2r$ bound
par: Date, Vinicius Tikara Venturi, et autres
Publié: (2026)

SimdQuickHeap: The QuickHeap Reconsidered
par: Breitling, Johannes, et autres
Publié: (2026)

Approximately Partitioning Vertices into Short Paths
par: Gong, Mingyang, et autres
Publié: (2026)

Forwarding Packets Greedily
par: Boyar, Joan, et autres
Publié: (2026)

Online Combinatorial Optimization with Graphical Dependencies
par: Gao, Zhimeng, et autres
Publié: (2025)

Exploiting Low Scanwidth to Resolve Soft Polytomies
par: Bruchhold, Sebastian, et autres
Publié: (2025)

A sufficient condition for characterizing the one-sided testable properties of families of graphs in the Random Neighbour Oracle Model
par: Awofeso, Christine, et autres
Publié: (2025)

Online computation of normalized substring complexity
par: Kucherov, Gregory, et autres
Publié: (2025)

Approximation algorithms for scheduling with rejection in green manufacturing
par: Gong, Mingyang, et autres
Publié: (2025)

Polytope Scheduling with Groups: Unified Models and Optimal Guarantees
par: Lindermayr, Alexander, et autres
Publié: (2025)

Minimum Riesz s-Energy Subset Selection in Ordered Point Sets via Dynamic Programming
par: Emmerich, Michael
Publié: (2025)

Connected Components in Linear Work and Near-Optimal Time
par: Farhadi, Alireza, et autres
Publié: (2023)

Online $b$-Matching with Stochastic Rewards
par: Albers, Susanne, et autres
Publié: (2024)

Hierarchical Exponential Search Via K-Spines
par: Dong, Bob
Publié: (2025)

On the satisfability of random k-Horn formulae
par: Istrate, Gabriel
Publié: (2000)

Approximation algorithms for Job Scheduling with reconfigurable resources
par: Bergé, Pierre, et autres
Publié: (2023)

Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop
par: Antoniadis, Antonios, et autres
Publié: (2020)

Online Interval Scheduling with Predictions
par: Boyar, Joan, et autres
Publié: (2023)