research
∙
08/25/2022
Learning to Prune Instances of Steiner Tree Problem in Graphs
We consider the Steiner tree problem on graphs where we are given a set ...
share
research
∙
04/19/2021
Learning to Sparsify Travelling Salesman Problem Instances
In order to deal with the high development time of exact and approximati...
research
∙
01/27/2020
Towards Quantifying the Distance between Opinions
Increasingly, critical decisions in public policy, governance, and busin...
research
∙
01/05/2020
Learning fine-grained search space pruning and heuristics for combinatorial optimization
Combinatorial optimization problems arise in a wide range of application...
research
∙
11/13/2019
Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries
We study ranked enumeration of the results to a join query in order of d...
research
∙
09/12/2019
Learning Multi-Stage Sparsification for Maximum Clique Enumeration
We propose a multi-stage learning approach for pruning the search space ...
research
∙
02/16/2018
Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs
Many problems in areas as diverse as recommendation systems, social netw...
research
∙
04/20/2016
