Andreas Wiese
YOU?
Author Swipe
View article: Finding Possible Winners in Spatial Voting with Incomplete Information
Finding Possible Winners in Spatial Voting with Incomplete Information Open
We consider a spatial voting model where both candidates and voters are positioned in the $d$-dimensional Euclidean space, and each voter ranks candidates based on their proximity to the voter's ideal point. We focus on the scenario where …
View article: A simpler QPTAS for scheduling jobs with precedence constraints
A simpler QPTAS for scheduling jobs with precedence constraints Open
We study the classical scheduling problem of minimizing the makespan of a set of unit size jobs with precedence constraints on parallel identical machines. Research on the problem dates back to the landmark paper by Graham from 1966 who sh…
View article: An Improved Guillotine Cut for Squares
An Improved Guillotine Cut for Squares Open
Given a set of n non-overlapping geometric objects, can we separate a constant fraction of them using straight-line cuts that extend from edge to edge? In 1996, Urrutia posed this question for compact convex objects. Pach and Tardos later …
View article: Exact and approximation algorithms for routing a convoy through a graph
Exact and approximation algorithms for routing a convoy through a graph Open
View article: A Deadline-Aware Scheduler for Smart Factory using WiFi 6
A Deadline-Aware Scheduler for Smart Factory using WiFi 6 Open
A key strategy for making production in factories more efficient is to collect data about the functioning of machines, and dynamically adapt their working. Such smart factories have data packets with a mix of stringent and non-stringent de…
View article: Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically
Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically Open
An important goal in algorithm design is determining the best running time for solving a problem (approximately). For some problems, we know the optimal running time, assuming certain conditional lower bounds. In this work, we study the $d…
View article: On the Two-Dimensional Knapsack Problem for Convex Polygons
On the Two-Dimensional Knapsack Problem for Convex Polygons Open
We study the two-dimensional geometric knapsack problem for convex polygons. Given a set of weighted convex polygons and a square knapsack, the goal is to select the most profitable subset of the given polygons that fits non-overlappingly …
View article: Scheduling on a Stochastic Number of Machines
Scheduling on a Stochastic Number of Machines Open
We consider a new scheduling problem on parallel identical machines in which the number of machines is initially not known, but it follows a given probability distribution. Only after all jobs are assigned to a given number of bags, the ac…
View article: Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects
Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects Open
We study the geometric knapsack problem in which we are given a set of d-dimensional objects (each with associated profits) and the goal is to find the maximum profit subset that can be packed non-overlappingly into a given d-dimensional (…
View article: On Approximation Schemes for Stabbing Rectilinear Polygons
On Approximation Schemes for Stabbing Rectilinear Polygons Open
We study the problem of stabbing rectilinear polygons, where we are given n rectilinear polygons in the plane that we want to stab, i.e., we want to select horizontal line segments such that for each given rectilinear polygon there is a li…
View article: Scheduling on a Stochastic Number of Machines
Scheduling on a Stochastic Number of Machines Open
We consider a new scheduling problem on parallel identical machines in which the number of machines is initially not known, but it follows a given probability distribution. Only after all jobs are assigned to a given number of bags, the ac…
View article: A $(3+ε)$-approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower bounds
A $(3+ε)$-approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower bounds Open
For a given set of points in a metric space and an integer $k$, we seek to partition the given points into $k$ clusters. For each computed cluster, one typically defines one point as the center of the cluster. A natural objective is to min…
View article: Simpler constant factor approximation algorithms for weighted flow time -- now for any $p$-norm
Simpler constant factor approximation algorithms for weighted flow time -- now for any $p$-norm Open
A prominent problem in scheduling theory is the weighted flow time problem on one machine. We are given a machine and a set of jobs, each of them characterized by a processing time, a release time, and a weight. The goal is to find a (poss…
View article: A PTAS for Minimizing Weighted Flow Time on a Single Machine
A PTAS for Minimizing Weighted Flow Time on a Single Machine Open
An important objective function in the scheduling literature is to minimize the sum of weighted flow times. We are given a set of jobs, where each job is characterized by a release time, a processing time, and a weight. Our goal is to find…
View article: Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set
Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set Open
Set cover and hitting set are fundamental problems in combinatorial optimization which are well-studied in the offline, online, and dynamic settings. We study the geometric versions of these problems and present new online and dynamic algo…
View article: Optimal Fully Dynamic <i>k</i>-Center Clustering for Adaptive and Oblivious Adversaries
Optimal Fully Dynamic <i>k</i>-Center Clustering for Adaptive and Oblivious Adversaries Open
In fully dynamic clustering problems, a clustering of a given data set in a\nmetric space must be maintained while it is modified through insertions and\ndeletions of individual points. In this paper, we resolve the complexity of\nfully dy…
View article: Breaking the barrier of 2 for the storage allocation problem
Breaking the barrier of 2 for the storage allocation problem Open
Packing problems are an important class of optimization problems. The probably most well-known problem if this type is knapsack and many generalizations of it have been studied in the literature like Two-dimensional Geometric Knapsack (2DK…
View article: A PTAS for Minimizing Weighted Flow Time on a Single Machine
A PTAS for Minimizing Weighted Flow Time on a Single Machine Open
An important objective in scheduling literature is to minimize the sum of weighted flow times. We are given a set of jobs where each job is characterized by a release time, a processing time, and a weight. Our goal is to find a preemptive …
View article: Tight Approximation Algorithms for Two Dimensional Guillotine Strip Packing
Tight Approximation Algorithms for Two Dimensional Guillotine Strip Packing Open
In the Strip Packing problem (SP), we are given a vertical half-strip $[0,W]\times[0,\infty)$ and a set of $n$ axis-aligned rectangles of width at most $W$. The goal is to find a non-overlapping packing of all rectangles into the strip suc…
View article: Approximation Algorithms for ROUND-UFP and ROUND-SAP
Approximation Algorithms for ROUND-UFP and ROUND-SAP Open
We study ROUND-UFP and ROUND-SAP, two generalizations of the classical BIN PACKING problem that correspond to the unsplittable flow problem on a path (UFP) and the storage allocation problem (SAP), respectively. We are given a path with ca…
View article: On Dynamic α + 1 Arboricity Decomposition and Out-Orientation
On Dynamic α + 1 Arboricity Decomposition and Out-Orientation Open
A graph has arboricity α if its edges can be partitioned into α forests. The dynamic arboricity decomposition problem is to update a partitioning of the graph’s edges into forests, as a graph undergoes insertions and deletions of edges. We…
View article: On fully dynamic constant-factor approximation algorithms for clustering problems
On fully dynamic constant-factor approximation algorithms for clustering problems Open
Clustering is an important task with applications in many fields of computer science. We study the fully dynamic setting in which we want to maintain good clusters efficiently when input points (from a metric space) can be inserted and del…
View article: A PTAS for the horizontal rectangle stabbing problem
A PTAS for the horizontal rectangle stabbing problem Open
We study rectangle stabbing problems in which we are given $n$ axis-aligned rectangles in the plane that we want to stab, i.e., we want to select line segments such that for each given rectangle there is a line segment that intersects two …
View article: Approximating Geometric Knapsack via L-packings
Approximating Geometric Knapsack via L-packings Open
We study the two-dimensional geometric knapsack problem, in which we are given a set of n axis-aligned rectangular items, each one with an associated profit, and an axis-aligned square knapsack. The goal is to find a (non-overlapping) pack…
View article: Partitioned EDF scheduling on a few types of unrelated multiprocessors
Partitioned EDF scheduling on a few types of unrelated multiprocessors Open
A polynomial-time approximation scheme (PTAS) is derived for the partitioned EDF scheduling of implicit-deadline sporadic task systems upon unrelated multiprocessor platforms that are comprised of a constant number of distinct types of pro…
View article: A (2 + <i>ε</i> )-approximation algorithm for preemptive weighted flow time on a single machine
A (2 + <i>ε</i> )-approximation algorithm for preemptive weighted flow time on a single machine Open
Weighted flow time is a fundamental and very well-studied objective function in scheduling. In this paper, we study the setting of a single machine with preemptions.
View article: On Guillotine Separable Packings for the Two-dimensional Geometric Knapsack Problem
On Guillotine Separable Packings for the Two-dimensional Geometric Knapsack Problem Open
In two-dimensional geometric knapsack problem, we are given a set of n axis-aligned rectangular items and an axis-aligned square-shaped knapsack. Each item has integral width, integral height and an associated integral profit. The goal is …
View article: A 3-Approximation Algorithm for Maximum Independent Set of Rectangles
A 3-Approximation Algorithm for Maximum Independent Set of Rectangles Open
We study the Maximum Independent Set of Rectangles (MISR) problem, where we are given a set of axis-parallel rectangles in the plane and the goal is to select a subset of non-overlapping rectangles of maximum cardinality. In a recent break…
View article: A (2+\epsilon)-Approximation Algorithm for Maximum Independent Set of Rectangles
A (2+\epsilon)-Approximation Algorithm for Maximum Independent Set of Rectangles Open
We study the Maximum Independent Set of Rectangles (MISR) problem, where we are given a set of axis-parallel rectangles in the plane and the goal is to select a subset of non-overlapping rectangles of maximum cardinality. In a recent break…
View article: A (2+ε)-Approximation Algorithm for Maximum Independent Set of Rectangles
A (2+ε)-Approximation Algorithm for Maximum Independent Set of Rectangles Open
We study the Maximum Independent Set of Rectangles (MISR) problem, where we are given a set of axis-parallel rectangles in the plane and the goal is to select a subset of non-overlapping rectangles of maximum cardinality. In a recent break…