Hierarchy of Hub Covering Problems
Fuente:
arXiv
Guardado en:
| Autor principal: | Jost, Niklas |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Why Districting Becomes NP-hard
por: Jost, Niklas, et al.
Publicado: (2025)
por: Jost, Niklas, et al.
Publicado: (2025)
Leveraging Network Methods for Hub-like Microservice Detection
por: Bakhtin, Alexander, et al.
Publicado: (2025)
por: Bakhtin, Alexander, et al.
Publicado: (2025)
SAT-Solving the Poset Cover Problem
por: Yuan, Chih-Cheng Rex, et al.
Publicado: (2025)
por: Yuan, Chih-Cheng Rex, et al.
Publicado: (2025)
Linear Programming Hierarchies Collapse under Symmetry
por: Faenza, Yuri, et al.
Publicado: (2025)
por: Faenza, Yuri, et al.
Publicado: (2025)
Graph-SCP: Accelerating Set Cover Problems with Graph Neural Networks
por: Shafi, Zohair, et al.
Publicado: (2023)
por: Shafi, Zohair, et al.
Publicado: (2023)
Algorithms for the Global Domination Problem
por: Inza, Ernesto Parra, et al.
Publicado: (2023)
por: Inza, Ernesto Parra, et al.
Publicado: (2023)
Probabilistic Methods on Erdos Problems
por: Gilbert, Jesse
Publicado: (2011)
por: Gilbert, Jesse
Publicado: (2011)
The Fagnano Triangle Patrolling Problem
por: Georgiou, Konstantinos, et al.
Publicado: (2023)
por: Georgiou, Konstantinos, et al.
Publicado: (2023)
The Unreliable Job Selection and Sequencing Problem
por: Agnetis, Alessandro, et al.
Publicado: (2025)
por: Agnetis, Alessandro, et al.
Publicado: (2025)
A Computer-Assisted Proof of the Optimal Density Bound for Pinwheel Covering
por: Kawamura, Akitoshi, et al.
Publicado: (2025)
por: Kawamura, Akitoshi, et al.
Publicado: (2025)
Multi-Agent Search-Type Problems on Polygons
por: Georgiou, Konstantinos, et al.
Publicado: (2024)
por: Georgiou, Konstantinos, et al.
Publicado: (2024)
On the Hardness of Gray Code Problems for Combinatorial Objects
por: Merino, Arturo, et al.
Publicado: (2024)
por: Merino, Arturo, et al.
Publicado: (2024)
Bakry-Émery-Ricci curvature: An alternative network geometry measure in the expanding toolbox of graph Ricci curvatures
por: Mondal, Madhumita, et al.
Publicado: (2024)
por: Mondal, Madhumita, et al.
Publicado: (2024)
On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
por: Tellache, Nour ElHouda, et al.
Publicado: (2025)
por: Tellache, Nour ElHouda, et al.
Publicado: (2025)
Chemically inspired Erdős-Rényi oriented hypergraphs
por: Garcia-Chung, Angel, et al.
Publicado: (2023)
por: Garcia-Chung, Angel, et al.
Publicado: (2023)
Short Proof: Exact Solution to the Finite Frobenius Coin Problem
por: De Gaspari, Lorenzo, et al.
Publicado: (2025)
por: De Gaspari, Lorenzo, et al.
Publicado: (2025)
Lower Bounds for the Minimum Spanning Tree Cycle Intersection Problem
por: Dubinsky, Manuel, et al.
Publicado: (2024)
por: Dubinsky, Manuel, et al.
Publicado: (2024)
Hierarchies of Minion Tests for PCSPs through Tensors
por: Ciardo, Lorenzo, et al.
Publicado: (2022)
por: Ciardo, Lorenzo, et al.
Publicado: (2022)
A Scalable Lift-and-Project Differentiable Approach For the Maximum Cut Problem
por: Alkhouri, Ismail, et al.
Publicado: (2025)
por: Alkhouri, Ismail, et al.
Publicado: (2025)
The Labeled Coupon Collector Problem with Random Sample Sizes and Partial Recovery
por: Berrebi, Shoham Shimon, et al.
Publicado: (2025)
por: Berrebi, Shoham Shimon, et al.
Publicado: (2025)
The EnvDesign Model: A Method to Solve the Environment Design Problem
por: Sathiya, Akshay, et al.
Publicado: (2024)
por: Sathiya, Akshay, et al.
Publicado: (2024)
The Freight Multimodal Transport Problem with Buses and Drones: An Integrated Approach for Last-Mile Delivery
por: Su, E, et al.
Publicado: (2025)
por: Su, E, et al.
Publicado: (2025)
The Bottleneck Birthday Problem
por: Tripathy, Chijul B.
Publicado: (2025)
por: Tripathy, Chijul B.
Publicado: (2025)
Boundedness and Separation in the Graph Covering Number Framework
por: Goetze, Miriam, et al.
Publicado: (2025)
por: Goetze, Miriam, et al.
Publicado: (2025)
Covering Complete Geometric Graphs by Monotone Paths
por: Dumitrescu, Adrian, et al.
Publicado: (2025)
por: Dumitrescu, Adrian, et al.
Publicado: (2025)
The Storage Location Assignment and Picker Routing Problem: A Generic Branch-Cut-and-Price Algorithm
por: Prunet, Thibault, et al.
Publicado: (2024)
por: Prunet, Thibault, et al.
Publicado: (2024)
DRESS and the WL Hierarchy: Climbing One Deletion at a Time
por: Velilla, Eduar Castrillo
Publicado: (2026)
por: Velilla, Eduar Castrillo
Publicado: (2026)
The Rainbow Arborescence Problem on Cycles
por: Bérczi, Kristóf, et al.
Publicado: (2025)
por: Bérczi, Kristóf, et al.
Publicado: (2025)
On a Problem of Ramsey Theory
por: Frasser, Carlos E.
Publicado: (2024)
por: Frasser, Carlos E.
Publicado: (2024)
The Careless Coupon Collector's Problem
por: Cruciani, Emilio, et al.
Publicado: (2026)
por: Cruciani, Emilio, et al.
Publicado: (2026)
Hypergraph Representation via Axis-Aligned Point-Subspace Cover
por: Firman, Oksana, et al.
Publicado: (2021)
por: Firman, Oksana, et al.
Publicado: (2021)
Computational Complexity of Covering Colored Mixed Multigraphs with Simple Degree Partitions
por: Bok, Jan, et al.
Publicado: (2025)
por: Bok, Jan, et al.
Publicado: (2025)
On 3-Connected Planar Graphs with Unique Orientable Circuit Double Covers
por: Weiß, Meike, et al.
Publicado: (2026)
por: Weiß, Meike, et al.
Publicado: (2026)
Vertex-Based Localization of Generalized Turán Problems
por: Adak, Rajat, et al.
Publicado: (2025)
por: Adak, Rajat, et al.
Publicado: (2025)
On the Identity and Group Problems for Complex Heisenberg Matrices
por: Bell, Paul C., et al.
Publicado: (2023)
por: Bell, Paul C., et al.
Publicado: (2023)
Minimum Spanning Tree Cycle Intersection Problem
por: Dubinsky, Manuel, et al.
Publicado: (2021)
por: Dubinsky, Manuel, et al.
Publicado: (2021)
Localization: A Framework to Generalize Extremal Graph Problems
por: Adak, Rajat, et al.
Publicado: (2025)
por: Adak, Rajat, et al.
Publicado: (2025)
Approximating the Network Design Problem for Potential-Based Flows
por: Klimm, Max, et al.
Publicado: (2026)
por: Klimm, Max, et al.
Publicado: (2026)
Improving SAT Solvers on Orthogonal Latin Square Problems
por: Barnoff, Aaron, et al.
Publicado: (2026)
por: Barnoff, Aaron, et al.
Publicado: (2026)
Cube Height, Cube Width and Related Extremal Problems for Posets
por: Bastide, Paul, et al.
Publicado: (2025)
por: Bastide, Paul, et al.
Publicado: (2025)
Ejemplares similares
-
Why Districting Becomes NP-hard
por: Jost, Niklas, et al.
Publicado: (2025) -
Leveraging Network Methods for Hub-like Microservice Detection
por: Bakhtin, Alexander, et al.
Publicado: (2025) -
SAT-Solving the Poset Cover Problem
por: Yuan, Chih-Cheng Rex, et al.
Publicado: (2025) -
Linear Programming Hierarchies Collapse under Symmetry
por: Faenza, Yuri, et al.
Publicado: (2025) -
Graph-SCP: Accelerating Set Cover Problems with Graph Neural Networks
por: Shafi, Zohair, et al.
Publicado: (2023)