Saved in:
| Main Authors: | Sathiya, Akshay, Pandey, Rohit |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2412.18109 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Using Code Generation to Solve Open Instances of Combinatorial Design Problems
by: Rosin, Christopher D.
Published: (2025)
by: Rosin, Christopher D.
Published: (2025)
Approximating the Network Design Problem for Potential-Based Flows
by: Klimm, Max, et al.
Published: (2026)
by: Klimm, Max, et al.
Published: (2026)
Probabilistic Methods on Erdos Problems
by: Gilbert, Jesse
Published: (2011)
by: Gilbert, Jesse
Published: (2011)
Exploring Algorithmic Solutions for the Independent Roman Domination Problem in Graphs
by: Paul, Kaustav, et al.
Published: (2024)
by: Paul, Kaustav, et al.
Published: (2024)
Solving the Multiobjective Quasi-Clique Problem
by: Santos, Daniela Scherer dos, et al.
Published: (2024)
by: Santos, Daniela Scherer dos, et al.
Published: (2024)
SAT-Solving the Poset Cover Problem
by: Yuan, Chih-Cheng Rex, et al.
Published: (2025)
by: Yuan, Chih-Cheng Rex, et al.
Published: (2025)
Robust Filter Design for Graph Signals
by: Testa, Lucia, et al.
Published: (2024)
by: Testa, Lucia, et al.
Published: (2024)
Application of the Quantum Approximate Optimization Algorithm in Solving the Total Domination Problem
by: Pan, Haoqian, et al.
Published: (2024)
by: Pan, Haoqian, et al.
Published: (2024)
Hyper-Zagreb Indices of Hypergraphs with Application in Drug Design
by: Sanad, Abdulkafi
Published: (2025)
by: Sanad, Abdulkafi
Published: (2025)
Feature-Guided Metaheuristic with Diversity Management for Solving the Capacitated Vehicle Routing Problem
by: Herdianto, Bachtiar, et al.
Published: (2024)
by: Herdianto, Bachtiar, et al.
Published: (2024)
Block Designs and K-Geodetic Graphs: A Survey
by: Frasser, Carlos E.
Published: (2025)
by: Frasser, Carlos E.
Published: (2025)
Algorithmic Results for Weak Roman Domination Problem in Graphs
by: Paul, Kaustav, et al.
Published: (2024)
by: Paul, Kaustav, et al.
Published: (2024)
Solving the List Coloring Problem through a Branch-and-Price algorithm
by: Lucci, Mauro, et al.
Published: (2023)
by: Lucci, Mauro, et al.
Published: (2023)
A Decomposition Method for the Hybrid Quantum-Classical Solution of the Number Partitioning Problem
by: Li, Zongji, et al.
Published: (2023)
by: Li, Zongji, et al.
Published: (2023)
Hierarchy of Hub Covering Problems
by: Jost, Niklas
Published: (2025)
by: Jost, Niklas
Published: (2025)
Algorithms for the Global Domination Problem
by: Inza, Ernesto Parra, et al.
Published: (2023)
by: Inza, Ernesto Parra, et al.
Published: (2023)
The Fagnano Triangle Patrolling Problem
by: Georgiou, Konstantinos, et al.
Published: (2023)
by: Georgiou, Konstantinos, et al.
Published: (2023)
Quantum circuit model for discrete-time three-state quantum walks on Cayley graphs
by: Sarkar, Rohit Sarma, et al.
Published: (2024)
by: Sarkar, Rohit Sarma, et al.
Published: (2024)
Edge open packing: further characterizations
by: Pandey, Arti, et al.
Published: (2025)
by: Pandey, Arti, et al.
Published: (2025)
The Unreliable Job Selection and Sequencing Problem
by: Agnetis, Alessandro, et al.
Published: (2025)
by: Agnetis, Alessandro, et al.
Published: (2025)
A Scalable Lift-and-Project Differentiable Approach For the Maximum Cut Problem
by: Alkhouri, Ismail, et al.
Published: (2025)
by: Alkhouri, Ismail, 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)
Multi-Agent Search-Type Problems on Polygons
by: Georgiou, Konstantinos, et al.
Published: (2024)
by: Georgiou, Konstantinos, et al.
Published: (2024)
On the Hardness of Gray Code Problems for Combinatorial Objects
by: Merino, Arturo, et al.
Published: (2024)
by: Merino, Arturo, et al.
Published: (2024)
Solving decision problems by distributed consensus with one-dimensional, binary, radius-$2$ cellular automata over cyclic configurations
by: Ruivo, Eurico, et al.
Published: (2025)
by: Ruivo, Eurico, et al.
Published: (2025)
The Storage Location Assignment and Picker Routing Problem: A Generic Branch-Cut-and-Price Algorithm
by: Prunet, Thibault, et al.
Published: (2024)
by: Prunet, Thibault, et al.
Published: (2024)
Improved Hotplug Caching Schemes Using PDAs and t-Designs
by: Rajput, Charul, et al.
Published: (2023)
by: Rajput, Charul, et al.
Published: (2023)
A Method to Generate Multi-interval Pairwise Compatibility Graphs
by: Hayat, Seemab, et al.
Published: (2024)
by: Hayat, Seemab, et al.
Published: (2024)
Lower Bounds for the Minimum Spanning Tree Cycle Intersection Problem
by: Dubinsky, Manuel, et al.
Published: (2024)
by: Dubinsky, Manuel, et al.
Published: (2024)
Short Proof: Exact Solution to the Finite Frobenius Coin Problem
by: De Gaspari, Lorenzo, et al.
Published: (2025)
by: De Gaspari, Lorenzo, et al.
Published: (2025)
Vertex-edge domination on subclasses of bipartite graphs
by: Pandey, Arti, et al.
Published: (2025)
by: Pandey, Arti, et al.
Published: (2025)
Characterizing optimal monitoring edge-geodetic sets for some structured graph classes
by: Foucaud, Florent, et al.
Published: (2025)
by: Foucaud, Florent, et al.
Published: (2025)
Enumeration of Row-Column Designs
by: Jäger, Gerold, et al.
Published: (2024)
by: Jäger, Gerold, et al.
Published: (2024)
Excluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance Measure
by: Dadush, Daniel, et al.
Published: (2025)
by: Dadush, Daniel, et al.
Published: (2025)
The Labeled Coupon Collector Problem with Random Sample Sizes and Partial Recovery
by: Berrebi, Shoham Shimon, et al.
Published: (2025)
by: Berrebi, Shoham Shimon, et al.
Published: (2025)
The Bottleneck Birthday Problem
by: Tripathy, Chijul B.
Published: (2025)
by: Tripathy, Chijul B.
Published: (2025)
Localization: A Framework to Generalize Extremal Graph Problems
by: Adak, Rajat, et al.
Published: (2025)
by: Adak, Rajat, et al.
Published: (2025)
On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
by: Tellache, Nour ElHouda, et al.
Published: (2025)
by: Tellache, Nour ElHouda, et al.
Published: (2025)
On a Problem of Ramsey Theory
by: Frasser, Carlos E.
Published: (2024)
by: Frasser, Carlos E.
Published: (2024)
The Rainbow Arborescence Problem on Cycles
by: Bérczi, Kristóf, et al.
Published: (2025)
by: Bérczi, Kristóf, et al.
Published: (2025)
Similar Items
-
Using Code Generation to Solve Open Instances of Combinatorial Design Problems
by: Rosin, Christopher D.
Published: (2025) -
Approximating the Network Design Problem for Potential-Based Flows
by: Klimm, Max, et al.
Published: (2026) -
Probabilistic Methods on Erdos Problems
by: Gilbert, Jesse
Published: (2011) -
Exploring Algorithmic Solutions for the Independent Roman Domination Problem in Graphs
by: Paul, Kaustav, et al.
Published: (2024) -
Solving the Multiobjective Quasi-Clique Problem
by: Santos, Daniela Scherer dos, et al.
Published: (2024)