Search
Search Results
-
-
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...
-
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...
-
Analysing Equilibrium States for Population Diversity
Population diversity is crucial in evolutionary algorithms as it helps with global exploration and facilitates the use of crossover. Despite many...
-
Min Orderings and List Homomorphism Dichotomies for Graphs and Signed Graphs
Since the CSP dichotomy conjecture has been established, a number of other dichotomy questions have attracted interest, including one for list...
-
Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs
A conflict-free coloring of a graph G is a (partial) coloring of its vertices such that every vertex u has a neighbor whose assigned color is unique...
-
The Impacts of Dimensionality, Diffusion, and Directedness on Intrinsic Cross-Model Simulation in Tile-Based Self-Assembly
Motivated by applications in DNA-nanotechnology, theoretical investigations in algorithmic tile-assembly have blossomed into a mature theory. In...
-
Category-Level Contrastive Learning for Unsupervised Hashing in Cross-Modal Retrieval
Unsupervised hashing for cross-modal retrieval has received much attention in the data mining area. Recent methods rely on image-text paired data to...
-
-
Extending Partial Representations of Circle Graphs in Near-Linear Time
The partial representation extension problem generalizes the recognition problem for geometric intersection graphs. The input consists of a graph G ,...
-
