all InfoSec news
Kernel Search approach to solve the Minimum Spanning Tree Problem with conflicting edge pairs. (arXiv:2401.02222v1 [math.OC])
Jan. 5, 2024, 2:10 a.m. | Francesco Carrabs, Martina Cerulli, Domenico Serra
cs.CR updates on arXiv.org arxiv.org
The Minimum Spanning Tree Problem with Conflicts consists in finding the
minimum conflict-free spanning tree of a graph, i.e., the spanning tree of
minimum cost, including no pairs of edges that are in conflict. In this paper,
we solve this problem using a tailored Kernel Search heuristic method, which
consists in solving iteratively improved restrictions of the problem. The main
novelty of the approach consists in using an independent set of the conflict
graph within the algorithm. We test our …
conflict cost edge free graph kernel math problem search spanning
More from arxiv.org / cs.CR updates on arXiv.org
Jobs in InfoSec / Cybersecurity
Social Engineer For Reverse Engineering Exploit Study
@ Independent study | Remote
Security Engineer II- Full stack Java with React
@ JPMorgan Chase & Co. | Hyderabad, Telangana, India
Cybersecurity SecOps
@ GFT Technologies | Mexico City, MX, 11850
Senior Information Security Advisor
@ Sun Life | Sun Life Toronto One York
Contract Special Security Officer (CSSO) - Top Secret Clearance
@ SpaceX | Hawthorne, CA
Early Career Cyber Security Operations Center (SOC) Analyst
@ State Street | Quincy, Massachusetts