12 citations · 32 across the 9 of their papers we have counts for
12 papers
Learning to Prune Instances of Steiner Tree Problem in Graphs
Jiwei Zhang, Deepak Ajwani
We consider the Steiner tree problem on graphs where we are given a set of nodes and the goal is to find a tree sub-graph of minimum weight that contains all nodes in the given set…
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…
Towards Quantifying the Distance between Opinions
Saket Gurukar, Deepak Ajwani, Sourav Dutta +3
Increasingly, critical decisions in public policy, governance, and business strategy rely on a deeper understanding of the needs and opinions of constituent members (e.g. citizens,…
Learning fine-grained search space pruning and heuristics for combinatorial optimization
Juho Lauri, Sourav Dutta, Marco Grassia +1
Combinatorial optimization problems arise in a wide range of applications from diverse domains. Many of these problems are NP-hard and designing efficient heuristics for them requi…
Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries
Nikolaos Tziavelis, Deepak Ajwani, Wolfgang Gatterbauer +2
We study ranked enumeration of join-query results according to very general orders defined by selective dioids. Our main contribution is a framework for ranked enumeration over a c…
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…