research
∙
05/18/2023
Submodularity Gaps for Selected Network Design and Matching Problems
Submodularity in combinatorial optimization has been a topic of many stu...
share
research
∙
04/29/2020
Dense Steiner problems: Approximation algorithms and inapproximability
The Steiner Tree problem is a classical problem in combinatorial optimiz...
research
∙
12/02/2019
Concave connection cost Facility Location and the Star Inventory Routing problem
We study a variant of the uncapacitated facility location problem (UFL),...
research
∙
12/02/2019
PTAS for Steiner Tree on Map Graphs
We study the Steiner tree problem on map graphs, which substantially gen...
research
∙
08/02/2019
Sound source detection, localization and classification using consecutive ensemble of CRNN models
In this paper, we describe our method for DCASE2019 task3: Sound Event L...
research
∙
11/20/2018
Tight Approximation Ratio for Minimum Maximal Matching
We study a combinatorial problem called Minimum Maximal Matching, where ...
research
∙
12/31/2017