Search
Search Results
-
Approximation and Online Algorithms 22nd International Workshop, WAOA 2024, Egham, UK, September 5–6, 2024, Proceedings
This book constitutes the refereed proceedings of the 22nd International Workshop on Approximation and Online Algorithms, WAOA 2024, held in Egham,...
-
Approximation and Online Algorithms 21st International Workshop, WAOA 2023, Amsterdam, The Netherlands, September 7–8, 2023, Proceedings
This book constitutes the refereed proceedings of the 21st International Workshop on Approximation and Online Algorithms, WAOA 2023, held in...
-
Approximation Algorithms with Constant Factors for a Series of Asymmetric Routing Problems
AbstractIn this paper, the first fixed-ratio approximation algorithms are proposed for a series of asymmetric settings of well-known combinatorial...
-
Implementation and analysis of GPU algorithms for Vecchia Approximation
Gaussian Processes have become an indispensable part of the spatial statistician’s toolbox but are unsuitable for analyzing large datasets because of...
-
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...
-
Fast and accurate approximation algorithms for computing floating point square root
The square root is one of the most used functions in many different engineering and scientific applications. We propose new methods for calculating...
-
Choice of Approximation Bases Used in Computational Functional Algorithms for Approximating Probability Densities on the Basis of Given Sample
AbstractIn this paper we formulate requirements for choosing approximation bases when constructing cost-effective optimized computational (numerical)...
-
Approximation and Online Algorithms 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8–9, 2022, Proceedings
This book constitutes revised selected papers from the thoroughly refereed workshop proceedings of the 20th International Workshop on Approximation...
-
Approximation algorithms for stochastic online matching with reusable resources
We consider a class of stochastic online matching problems, where a set of sequentially arriving jobs are to be matched to a group of workers. The...
-
Practical Sketching Algorithms for Low-Rank Tucker Approximation of Large Tensors
Low-rank approximation of tensors has been widely used in high-dimensional data analysis. It usually involves singular value decomposition (SVD) of...
-
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...
-
Approximation algorithms for maximum weighted target cover problem with distance limitations
In this paper, we study approximation algorithms for the problem of maximum weighted target cover with distance limitations (MaxWTCDL). Given n ...
-
Approximation Algorithms for the Two-Watchman Route in a Simple Polygon
The two-watchman route problem is that of computing a pair of closed tours in an environment so that the two tours together see the whole environment...
-
Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms
We consider scheduling monotonic moldable tasks on multiple platforms, where each platform contains a set of processors. A moldable task can be split...
-
-
Efficient approximation and privacy preservation algorithms for real time online evolving data streams
Because of the processing of continuous unstructured large streams of data, mining real-time streaming data is a more challenging research issue than...
-
On parameterized approximation algorithms for balanced clustering
Balanced clustering is a frequently encountered problem in applications requiring balanced class distributions, which generalizes the standard...
-
-
-
Approximation algorithms for flexible graph connectivity
We present approximation algorithms for several network design problems in the model of flexible graph connectivity (Adjiashvili et al., in: IPCO, pp...
