Sample compression schemes for balls in graphs
Fuente:
arXiv
Saved in:
| Main Authors: | Chalopin, Jérémie, Chepoi, Victor, Inerney, Fionn Mc, Ratel, Sébastien, Vaxès, Yann |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Non-Clashing Teaching Maps for Balls in Graphs
by: Chalopin, Jérémie, et al.
Published: (2023)
by: Chalopin, Jérémie, et al.
Published: (2023)
ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G$^2$-connected medians
by: Bénéteau, Laurine, et al.
Published: (2022)
by: Bénéteau, Laurine, et al.
Published: (2022)
Boundary rigidity of finite CAT(0) cube complexes
by: Chalopin, Jérémie, et al.
Published: (2023)
by: Chalopin, Jérémie, et al.
Published: (2023)
Distance-based certification for leader election in meshed graphs and local recognition of their subclasses
by: Chalopin, Jérémie, et al.
Published: (2026)
by: Chalopin, Jérémie, et al.
Published: (2026)
Isometric path complexity of graphs
by: Chakraborty, Dibyayan, et al.
Published: (2022)
by: Chakraborty, Dibyayan, et al.
Published: (2022)
First-order logic axiomatization of metric graph theory
by: Chalopin, Jérémie, et al.
Published: (2022)
by: Chalopin, Jérémie, et al.
Published: (2022)
Sample compression schemes for balls in structurally sparse graphs
by: Bourneuf, Romain, et al.
Published: (2026)
by: Bourneuf, Romain, et al.
Published: (2026)
Non-Clashing Teaching in Graphs: Algorithms, Complexity, and Bounds
by: Bhore, Sujoy, et al.
Published: (2026)
by: Bhore, Sujoy, et al.
Published: (2026)
The Parameterized Complexity of Computing the VC-Dimension
by: Foucaud, Florent, et al.
Published: (2025)
by: Foucaud, Florent, et al.
Published: (2025)
The Computational Complexity of Positive Non-Clashing Teaching in Graphs
by: Ganian, Robert, et al.
Published: (2025)
by: Ganian, Robert, et al.
Published: (2025)
Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs
by: Bressan, Marco, et al.
Published: (2025)
by: Bressan, Marco, et al.
Published: (2025)
Separation axiom $S_3$ for geodesic convexity in graphs
by: Chepoi, Victor
Published: (2024)
by: Chepoi, Victor
Published: (2024)
Enumerating minimal solution sets for metric graph problems
by: Bergougnoux, Benjamin, et al.
Published: (2023)
by: Bergougnoux, Benjamin, et al.
Published: (2023)
Hypergraph dualization with FPT-delay parameterized by the degeneracy and dimension
by: Bartier, Valentin, et al.
Published: (2023)
by: Bartier, Valentin, et al.
Published: (2023)
Generating minimal redundant and maximal irredundant sets in incidence graphs
by: Castelo, Emanuel, et al.
Published: (2026)
by: Castelo, Emanuel, et al.
Published: (2026)
Feature-Aware (Hyper)graph Generation via Next-Scale Prediction
by: Gailhard, Dorian, et al.
Published: (2025)
by: Gailhard, Dorian, et al.
Published: (2025)
On $G^p$-unimodality of radius functions in graphs: structure and algorithms
by: Chalopin, Jérémie, et al.
Published: (2025)
by: Chalopin, Jérémie, et al.
Published: (2025)
Atomic Column Generation For Consensus Between Algorithms: Application to Path Computation
by: Martin, Sébastien, et al.
Published: (2025)
by: Martin, Sébastien, et al.
Published: (2025)
Geometry of ample/lopsided sets
by: Bandelt, Hans--Jürgen, et al.
Published: (2026)
by: Bandelt, Hans--Jürgen, et al.
Published: (2026)
Dynamic Structure Estimation from Bandit Feedback using Nonvanishing Exponential Sums
by: Ohnishi, Motoya, et al.
Published: (2022)
by: Ohnishi, Motoya, et al.
Published: (2022)
Graph-SCP: Accelerating Set Cover Problems with Graph Neural Networks
by: Shafi, Zohair, et al.
Published: (2023)
by: Shafi, Zohair, et al.
Published: (2023)
Deep Learning for Unrelated-Machines Scheduling: Handling Variable Dimensions
by: Hitzges, Diego, et al.
Published: (2025)
by: Hitzges, Diego, et al.
Published: (2025)
A Fast and Effective Method for Euclidean Anticlustering: The Assignment-Based-Anticlustering Algorithm
by: Baumann, Philipp, et al.
Published: (2026)
by: Baumann, Philipp, et al.
Published: (2026)
MILP-StuDio: MILP Instance Generation via Block Structure Decomposition
by: Liu, Haoyang, et al.
Published: (2024)
by: Liu, Haoyang, et al.
Published: (2024)
Adaptive Combinatorial Maximization: Beyond Approximate Greedy Policies
by: Weitzman, Shlomi, et al.
Published: (2024)
by: Weitzman, Shlomi, et al.
Published: (2024)
Polynomial Regret Concentration of UCB for Non-Deterministic State Transitions
by: Cömer, Can, et al.
Published: (2025)
by: Cömer, Can, et al.
Published: (2025)
Machine Learning Optimal Ordering in Global Routing Problems in Semiconductors
by: Choi, Heejin, et al.
Published: (2024)
by: Choi, Heejin, et al.
Published: (2024)
Fine-Grained Expressive Power of Weisfeiler-Leman: A Homomorphism Counting Perspective
by: Zhou, Junru, et al.
Published: (2024)
by: Zhou, Junru, et al.
Published: (2024)
Isolation Forest in Novelty Detection Scenario
by: Ulrich, Adam, et al.
Published: (2025)
by: Ulrich, Adam, et al.
Published: (2025)
Contradiction Graphs Determine VC Dimension
by: Campbell, Jesse, et al.
Published: (2026)
by: Campbell, Jesse, et al.
Published: (2026)
On Local Limits of Sparse Random Graphs: Color Convergence and the Refined Configuration Model
by: Pluska, Alexander, et al.
Published: (2025)
by: Pluska, Alexander, et al.
Published: (2025)
HyP-ASO: A Hybrid Policy-based Adaptive Search Optimization Framework for Large-Scale Integer Linear Programs
by: Xu, Ning, et al.
Published: (2025)
by: Xu, Ning, et al.
Published: (2025)
Partial Optimality in Cubic Correlation Clustering for General Graphs
by: Stein, David, et al.
Published: (2025)
by: Stein, David, et al.
Published: (2025)
Differentiable Quadratic Optimization For The Maximum Independent Set Problem
by: Alkhouri, Ismail, et al.
Published: (2024)
by: Alkhouri, Ismail, et al.
Published: (2024)
A Unified Approach to Inferring Chemical Compounds with the Desired Aqueous Solubility
by: Batool, Muniba, et al.
Published: (2024)
by: Batool, Muniba, et al.
Published: (2024)
On the Expressiveness of Rational ReLU Neural Networks With Bounded Depth
by: Averkov, Gennadiy, et al.
Published: (2025)
by: Averkov, Gennadiy, et al.
Published: (2025)
GraphOmni: A Comprehensive and Extensible Benchmark Framework for Large Language Models on Graph-theoretic Tasks
by: Xu, Hao, et al.
Published: (2025)
by: Xu, Hao, et al.
Published: (2025)
HYGENE: A Diffusion-based Hypergraph Generation Method
by: Gailhard, Dorian, et al.
Published: (2024)
by: Gailhard, Dorian, et al.
Published: (2024)
Graph Edit Distance Formulation for the Vehicle Routing Problem: Theory and Analysis
by: Dabah, Adel
Published: (2026)
by: Dabah, Adel
Published: (2026)
Graph-Based Semi-Supervised Segregated Lipschitz Learning
by: Bozorgnia, Farid, et al.
Published: (2024)
by: Bozorgnia, Farid, et al.
Published: (2024)
Similar Items
-
Non-Clashing Teaching Maps for Balls in Graphs
by: Chalopin, Jérémie, et al.
Published: (2023) -
ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G$^2$-connected medians
by: Bénéteau, Laurine, et al.
Published: (2022) -
Boundary rigidity of finite CAT(0) cube complexes
by: Chalopin, Jérémie, et al.
Published: (2023) -
Distance-based certification for leader election in meshed graphs and local recognition of their subclasses
by: Chalopin, Jérémie, et al.
Published: (2026) -
Isometric path complexity of graphs
by: Chakraborty, Dibyayan, et al.
Published: (2022)