3 citations · 9 across the 7 of their papers we have counts for
10 papers
On Streaming Algorithms for the Steiner Cycle and Path Cover Problem on Interval Graphs and Falling Platforms in Video Games
Ante Ćustić, Stefan Lendl
We introduce a simplified model for platform game levels with falling platforms based on interval graphs and show that solvability of such levels corresponds to finding Steiner cyc…
Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms
Vladyslav Sokol, Ante Ćustić, Abraham P. Punnen +1
The bilinear assignment problem (BAP) is a generalization of the well-known quadratic assignment problem (QAP). In this paper, we study the problem from the computational analysis…
The Bilinear Assignment Problem: Complexity and polynomially solvable special cases
Ante Ćustić, Vladyslav Sokol, Abraham P. Punnen +1
In this paper we study the {\it bilinear assignment problem} (BAP) with size parameters and , . BAP is a generalization of the well known quadratic assignment probl…
The Quadratic Minimum Spanning Tree Problem and its Variations
Ante Ćustić, Ruonan Zhang, Abraham P. Punnen
The quadratic minimum spanning tree problem and its variations such as the quadratic bottleneck spanning tree problem, the minimum spanning tree problem with conflict pair constrai…
Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis
Ante Ćustić, Abraham P. Punnen
In this paper we study the complexity and domination analysis in the context of the \emph{bipartite quadratic assignment problem}. Two variants of the problem, denoted by BQAP1 and…
Geometric k-Center Problems with Centers Constrained to Two Lines
Binay Bhattacharya, Sandip Das, Yuya Higashikawa +2
We consider the -center problem in which the centers are constrained to lie on two lines. Given a set of weighted points in the plane, we want to locate up to centers on…