research
∙
07/17/2023
Lipschitz Continuous Algorithms for Covering Problems
Combinatorial algorithms are widely used for decision-making and knowled...
share
research
∙
11/09/2022
Lipschitz Continuous Algorithms for Graph Problems
It has been widely observed in the machine learning community that a sma...
research
∙
04/28/2022
Learning General Inventory Management Policy for Large Supply Chain Network
Inventory management in warehouses directly affects profits made by manu...
research
∙
11/04/2021
Average Sensitivity of Dynamic Programming
When processing data with uncertainty, it is desirable that the output o...
research
∙
12/05/2020
r-Gathering Problems on Spiders:Hardness, FPT Algorithms, and PTASes
We consider the min-max r-gathering problem described as follows: We are...
research
∙
10/12/2020
Interval Query Problem on Cube-free Median Graphs
In this paper, we introduce the interval query problem on cube-free medi...
research
∙
07/09/2019
r-Gather Clustering and r-Gathering on Spider: FPT Algorithms and Hardness
We consider min-max r-gather clustering problem and min-max r-gathering ...
research
∙
07/09/2019
PTAS and Exact Algorithms for r-Gathering Problems on Tree
r-gathering problem is a variant of facility location problems. In this ...
research
∙
04/02/2019
Incorrect implementations of the Floyd--Warshall algorithm give correct solutions after three repeats
The Floyd--Warshall algorithm is a well-known algorithm for the all-pair...
research
∙
07/13/2018