Reducing Sensor Requirements by Relaxing the Network Metric Dimension
Fuente:
arXiv
Saved in:
| Main Authors: | Mürmann, Paula, Jaccard, Robin, Dreveton, Maximilien, Ravari, Aryan Alavi Razavi, Thiran, Patrick |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Trapping and commutative Boolean networks
by: Gadouleau, Maximilien
Published: (2026)
by: Gadouleau, Maximilien
Published: (2026)
Algorithms and hardness for Metric Dimension on digraphs
by: Dailly, Antoine, et al.
Published: (2023)
by: Dailly, Antoine, et al.
Published: (2023)
Metric Dimensions of March Madness Brackets
by: Spiro, Sam
Published: (2026)
by: Spiro, Sam
Published: (2026)
Multiset Metric Dimension of Binomial Random Graphs
by: Eide, Austin, et al.
Published: (2025)
by: Eide, Austin, et al.
Published: (2025)
On Euler Paths and the Maximum Degree Growth of Iterated Higher Order Line Graphs
by: Sanghi, Aryan, et al.
Published: (2026)
by: Sanghi, Aryan, et al.
Published: (2026)
Inferring Phylogenetic Networks from Required and Forbidden LCA-Constraints
by: Ebert, Patricia A., et al.
Published: (2026)
by: Ebert, Patricia A., et al.
Published: (2026)
Further Constructions of AMUBs for Non-prime power Composite Dimensions
by: Kumar, Ajeet, et al.
Published: (2024)
by: Kumar, Ajeet, et al.
Published: (2024)
Semirings of formal sums and injective partial transformations
by: Gadouleau, Maximilien, et al.
Published: (2026)
by: Gadouleau, Maximilien, et al.
Published: (2026)
On Maximal Families of Binary Polynomials with Pairwise Linear Common Factors
by: Gadouleau, Maximilien, et al.
Published: (2024)
by: Gadouleau, Maximilien, et al.
Published: (2024)
Concepts of Dimension for Convex Geometries
by: Knauer, Kolja, et al.
Published: (2023)
by: Knauer, Kolja, et al.
Published: (2023)
Generalising the maximum independent set algorithm via Boolean networks
by: Gadouleau, Maximilien, et al.
Published: (2024)
by: Gadouleau, Maximilien, et al.
Published: (2024)
Metric Dimension and Geodetic Set Parameterized by Vertex Cover
by: Foucaud, Florent, et al.
Published: (2024)
by: Foucaud, Florent, et al.
Published: (2024)
Flip Dynamics for Sampling Colorings: Improving $(11/6-ε)$ Using a Simple Metric
by: Carlson, Charlie, et al.
Published: (2024)
by: Carlson, Charlie, et al.
Published: (2024)
An SDP Relaxation for the Sparse Integer Least Squares Problem
by: Del Pia, Alberto, et al.
Published: (2022)
by: Del Pia, Alberto, et al.
Published: (2022)
From Tripods to Bipods: Reducing the Queue Number of Planar Graphs Costs Just One Leg
by: Förster, Henry
Published: (2024)
by: Förster, Henry
Published: (2024)
How to Color Temporal Graphs to Ensure Proper Transitions
by: Ibiapina, Allen, et al.
Published: (2025)
by: Ibiapina, Allen, et al.
Published: (2025)
Coloring bridge-free antiprismatic graphs
by: Robin, Cléophée, et al.
Published: (2024)
by: Robin, Cléophée, et al.
Published: (2024)
A Caro-Wei bound for induced linear forests in graphs
by: Joret, Gwenaël, et al.
Published: (2024)
by: Joret, Gwenaël, et al.
Published: (2024)
Boundary vertices of Strongly Connected Digraphs with respect to `Sum Metric'
by: Anand, Bijo S., et al.
Published: (2025)
by: Anand, Bijo S., et al.
Published: (2025)
On the Bidirected Cut Relaxation for Steiner Forest
by: Byrka, Jarosław, et al.
Published: (2024)
by: Byrka, Jarosław, et al.
Published: (2024)
Contradiction Graphs Determine VC Dimension
by: Campbell, Jesse, et al.
Published: (2026)
by: Campbell, Jesse, et al.
Published: (2026)
Efficient Reconstruction of Arboreal Networks
by: Huber, Katharina T., et al.
Published: (2026)
by: Huber, Katharina T., et al.
Published: (2026)
Minimum 0-Extension Problems on Directed Metrics
by: Hirai, Hiroshi, et al.
Published: (2020)
by: Hirai, Hiroshi, et al.
Published: (2020)
Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)
by: Bonnet, Édouard, et al.
Published: (2022)
by: Bonnet, Édouard, et al.
Published: (2022)
Expressivity of Geometric Inhomogeneous Random Graphs -- Metric and Non-Metric
by: Dayan, Benjamin, et al.
Published: (2024)
by: Dayan, Benjamin, et al.
Published: (2024)
Graph Theoretic Investigations on Inefficiencies in Network Models
by: Cenciarelli, Pietro, et al.
Published: (2016)
by: Cenciarelli, Pietro, et al.
Published: (2016)
Deep Learning for Unrelated-Machines Scheduling: Handling Variable Dimensions
by: Hitzges, Diego, et al.
Published: (2025)
by: Hitzges, Diego, et al.
Published: (2025)
Polynomial Kernels for Spanning Tree with Diversity Requirements
by: Golovach, Petr A., et al.
Published: (2026)
by: Golovach, Petr A., et al.
Published: (2026)
Some progress on $t$-tone coloring
by: Bennett, Patrick, et al.
Published: (2025)
by: Bennett, Patrick, et al.
Published: (2025)
Binomial Random Matroids
by: Bennett, Patrick, et al.
Published: (2026)
by: Bennett, Patrick, et al.
Published: (2026)
Stronger Hardness for Maximum Robust Flow and Randomized Network Interdiction
by: Matuschke, Jannik
Published: (2025)
by: Matuschke, Jannik
Published: (2025)
Dynamical Stability of Threshold Networks over Undirected Signed Graphs
by: Goles, Eric, et al.
Published: (2023)
by: Goles, Eric, et al.
Published: (2023)
Broadcast via Mobile Agents in a Dynamic Network: Interplay of Graph Properties & Agents
by: Moses Jr., William K., et al.
Published: (2025)
by: Moses Jr., William K., et al.
Published: (2025)
Topological Analysis and Synthesis of Structures related to Certain Classes of K-Geodetic Computer Networks
by: Frasser, Carlos E.
Published: (2017)
by: Frasser, Carlos E.
Published: (2017)
The Role of Dimension in the Online Chasing Problem
by: Papazov, Hristo
Published: (2023)
by: Papazov, Hristo
Published: (2023)
Multivariate Exploration of Metric Dilation
by: Banik, Aritra, et al.
Published: (2025)
by: Banik, Aritra, et al.
Published: (2025)
Solving systems of equations on antichains for the computation of the ninth Dedekind Number
by: De Causmaecker, Patrick, et al.
Published: (2024)
by: De Causmaecker, Patrick, et al.
Published: (2024)
Asymptotically Enumerating Independent Sets in Regular $k$-Partite $k$-Uniform Hypergraphs
by: Arras, Patrick, et al.
Published: (2024)
by: Arras, Patrick, et al.
Published: (2024)
On Connections Between Association Schemes and Analyses of Polyhedral and Positive Semidefinite Lift-and-Project Relaxations
by: Au, Yu Hin, et al.
Published: (2020)
by: Au, Yu Hin, et al.
Published: (2020)
The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller than 2
by: Byrka, Jarosław, et al.
Published: (2024)
by: Byrka, Jarosław, et al.
Published: (2024)
Similar Items
-
Trapping and commutative Boolean networks
by: Gadouleau, Maximilien
Published: (2026) -
Algorithms and hardness for Metric Dimension on digraphs
by: Dailly, Antoine, et al.
Published: (2023) -
Metric Dimensions of March Madness Brackets
by: Spiro, Sam
Published: (2026) -
Multiset Metric Dimension of Binomial Random Graphs
by: Eide, Austin, et al.
Published: (2025) -
On Euler Paths and the Maximum Degree Growth of Iterated Higher Order Line Graphs
by: Sanghi, Aryan, et al.
Published: (2026)