A prominent problem in scheduling theory is the weighted flow time probl...
In fully dynamic clustering problems, a clustering of a given data set i...
Set cover and hitting set are fundamental problems in combinatorial
opti...
An important objective in scheduling literature is to minimize the sum o...
In the Strip Packing problem (SP), we are given a vertical half-strip
[0...
We study ROUND-UFP and ROUND-SAP, two generalizations of the classical B...
Clustering is an important task with applications in many fields of comp...
We study rectangle stabbing problems in which we are given n axis-aligne...
We study the Maximum Independent Set of Rectangles (MISR) problem, where...
In the 2-Dimensional Knapsack problem (2DK) we are given a square
knapsa...
In two-dimensional geometric knapsack problem, we are given a set of n
a...
Weighted flow time is a fundamental and very well-studied objective func...
We study the two-dimensional geometric knapsack problem for convex polyg...
In this paper we introduce the concept of additive approximation schemes...
Knapsack problems are among the most fundamental problems in optimizatio...
Independent set is a fundamental problem in combinatorial optimization. ...
Graph coloring is a fundamental problem in computer science. We study th...
Packing problems are an important class of optimization problems. The
pr...
The area of parameterized approximation seeks to combine approximation a...
Linear programming is a powerful method in combinatorial optimization wi...
We consider two optimization problems in planar graphs. In Maximum Weigh...
We study the two-dimensional geometric knapsack problem (2DK) in which w...
A model has been proposed in [Baruah et al., in Proceedings of the IEEE
...