3 citations · 3 across the 2 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2018
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…
cs.DS2017
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…
cs.DS2016
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…