Image de couverture de livre

Approximating Optimal Labelings for Temporal Connectivity

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Carnevale, Daniele, D'Angelo, Gianlorenzo, Olsen, Martin
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Artificial Intelligence
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Optimizing Distances for Multi-Broadcast in Temporal Graphs
par: Carnevale, Daniele, et autres
Publié: (2026)

Approximation Algorithms for Connected Maximum Coverage, Minimum Connected Set Cover, and Node-Weighted Group Steiner Tree
par: D'Angelo, Gianlorenzo, et autres
Publié: (2025)

Efficient generation of expected-degree graphs via edge-arrivals
par: D'Angelo, Gianlorenzo, et autres
Publié: (2026)

Clustering with Label Consistency
par: Chakraborty, Diptarka, et autres
Publié: (2025)

Scalable Algorithms for Approximate DNF Model Counting
par: Burkhardt, Paul, et autres
Publié: (2026)

Nearly Optimal Attention Coresets
par: Liberty, Edo, et autres
Publié: (2026)

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data
par: Almansoori, Mahmood K. M., et autres
Publié: (2025)

Individual Fairness under Varied Notions of Group Fairness in Bipartite Matching - One Framework to Approximate Them All
par: Panda, Atasi, et autres
Publié: (2022)

Enhanced Deterministic Approximation Algorithm for Non-monotone Submodular Maximization under Knapsack Constraint with Linear Query Complexity
par: Pham, Canh V.
Publié: (2024)

Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search
par: Benomar, Ziyad, et autres
Publié: (2025)

Near-Optimal Vertex Fault-Tolerant Labels for Steiner Connectivity
par: Bhanja, Koustav, et autres
Publié: (2025)

Are Graph Neural Networks Optimal Approximation Algorithms?
par: Yau, Morris, et autres
Publié: (2023)

Fast Approximation Algorithm for Non-Monotone DR-submodular Maximization under Size Constraint
par: Tran, Tan D., et autres
Publié: (2025)

Approximate Lifted Model Construction
par: Luttermann, Malte, et autres
Publié: (2025)

A canonical generalization of OBDD
par: Capelli, Florent, et autres
Publié: (2026)

Streaming Attention Approximation via Discrepancy Theory
par: Kochetkova, Ekaterina, et autres
Publié: (2025)

Polynomial-Time Approximability of Constrained Reinforcement Learning
par: McMahan, Jeremy
Publié: (2025)

Nearly Optimal List Labeling
par: Bender, Michael A., et autres
Publié: (2024)

Fast Stochastic Greedy Algorithm for $k$-Submodular Cover Problem
par: Nguyen, Hue T., et autres
Publié: (2025)

Lower Bound on the Greedy Approximation Ratio for Adaptive Submodular Cover
par: Harris, Blake, et autres
Publié: (2024)

A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering
par: Bandyapadhyay, Sayan, et autres
Publié: (2024)

Connectivity Labeling in Faulty Colored Graphs
par: Petruschka, Asaf, et autres
Publié: (2024)

FPT Approximations for Connected Maximum Coverage
par: Inamdar, Tanmay, et autres
Publié: (2026)

Approximation Algorithms for Steiner Connectivity Augmentation
par: Hathcock, Daniel, et autres
Publié: (2023)

Pareto Optimal Algorithmic Recourse in Multi-cost Function
par: Chen, Wen-Ling, et autres
Publié: (2025)

Optimal Survival Trees: A Dynamic Programming Approach
par: Huisman, Tim, et autres
Publié: (2024)

9/7-Approximation for Two-Edge-Connectivity and Two-Vertex-Connectivity
par: Çivril, Ali
Publié: (2024)

Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity
par: Ganian, Robert, et autres
Publié: (2025)

Linearithmic Clean-up for Vector-Symbolic Key-Value Memory with Kroneker Rotation Products
par: Liu, Ruipeng, et autres
Publié: (2025)

Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problems
par: Wang, Long, et autres
Publié: (2025)

Queueing, Predictions, and LLMs: Challenges and Open Problems
par: Mitzenmacher, Michael, et autres
Publié: (2025)

Compatibility of Max and Sum Objectives for Committee Selection and $k$-Facility Location
par: Han, Yue, et autres
Publié: (2025)

Instance Dependent Testing of Samplers using Interval Conditioning
par: Bhattacharyya, Rishiraj, et autres
Publié: (2025)

Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set Approach
par: Ihalainen, Hannes, et autres
Publié: (2025)

An Extended Symbolic-Arithmetic Model for Teaching Double-Black Removal with Rotation in Red-Black Trees
par: Ehimwenma, Kennedy E., et autres
Publié: (2025)

Universal Hirschberg for Width Bounded Dynamic Programs
par: Nye, Logan
Publié: (2025)

Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size
par: Fioravantes, Foivos, et autres
Publié: (2025)

Efficient Implementation of the Global Cardinality Constraint with Costs
par: Schmied, Margaux, et autres
Publié: (2025)

Efficient Detection of Exchangeable Factors in Factor Graphs
par: Luttermann, Malte, et autres
Publié: (2024)

Masked Matrix Multiplication for Emergent Sparsity
par: Wheatman, Brian, et autres
Publié: (2024)