12 citations · 32 across the 9 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2021
Learning to Sparsify Travelling Salesman Problem Instances
James Fitzpatrick, Deepak Ajwani, Paula Carroll
In order to deal with the high development time of exact and approximation algorithms for NP-hard combinatorial optimisation problems and the high running time of exact solvers, de…
cs.LG2019★ 5 cited
Learning Multi-Stage Sparsification for Maximum Clique Enumeration
Marco Grassia, Juho Lauri, Sourav Dutta +1
We propose a multi-stage learning approach for pruning the search space of maximum clique enumeration, a fundamental computationally difficult problem arising in various network an…