12 citations · 32 across the 9 of their papers we have counts for
4 papers · 1 filter
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 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…
Empirical Evaluation of the Parallel Distribution Sweeping Framework on Multicore Architectures
Deepak Ajwani, Nodari Sitchinava
In this paper, we perform an empirical evaluation of the Parallel External Memory (PEM) model in the context of geometric problems. In particular, we implement the parallel distrib…
Average-Case Analysis of Online Topological Ordering
Deepak Ajwani, Tobias Friedrich
Many applications like pointer analysis and incremental compilation require maintaining a topological ordering of the nodes of a directed acyclic graph (DAG) under dynamic updates.…