Search
Search Results
-
Online Geometric Covering and Piercing
We consider the online version of the piercing set problem, where geometric objects arrive one by one, and the online algorithm must maintain a valid...
-
Slim Tree-Cut Width
Tree-cut width is a parameter that has been introduced as an attempt to obtain an analogue of treewidth for edge cuts. Unfortunately, in spite of its...
-
Approximating Long Cycle Above Dirac’s Guarantee
Parameterization above (or below) a guarantee is a successful concept in parameterized algorithms. The idea is that many computational problems admit...
-
New Algorithms for Steiner Tree Reoptimization
Reoptimization is a setting in which we are given a good approximate solution of an optimization problem instance and a local modification that...
-
Algebraic Global Gadgetry for Surjective Constraint Satisfaction
The constraint satisfaction problem (CSP) on a finite relational structure B is to decide, given a set of constraints on variables where the...
-
Approximation Algorithms for Covering Vertices by Long Paths
Given a graph, the general problem to cover the maximum number of vertices by a collection of vertex-disjoint long paths seems to escape from the...
-
-
Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions
We address long-standing open questions raised by Williamson, Goemans, Vazirani and Mihail pertaining to the design of approximation algorithms for...
-
Linear Resources in Isabelle/HOL
We present a formal framework for process composition based on actions that are specified by their input and output resources. The correctness of...
-
Parameterized Approximation Algorithms and Lower Bounds for k-Center Clustering and Variants
k -center is one of the most popular clustering models. While it admits a simple 2-approximation in polynomial time in general metrics, the Euclidean...
-
Sample-Based Distance-Approximation for Subsequence-Freeness
In this work, we study the problem of approximating the distance to subsequence-freeness in the sample-based distribution-free model. For a given...
-
Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus
We propose a new method based on discrete Fourier analysis to analyze the time evolutionary algorithms spend on plateaus. This immediately gives a...
-
Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data
Based on well-known complexity theory conjectures, any polynomial-time kernelization algorithm for the NP-hard Line- Cover problem produces a kernel...
-
-
-
Decoupling Anomaly Discrimination and Representation Learning: Self-supervised Learning for Anomaly Detection on Attributed Graph
Anomaly detection on attributed graphs is a crucial topic for practical applications. Existing methods suffer from semantic mixture and imbalance...
-
Runtime Analysis of Competitive Co-evolutionary Algorithms for Maximin Optimisation of a Bilinear Function
Co-evolutionary algorithms have a wide range of applications, such as in hardware design, evolution of strategies for board games, and patching...
