Results 31 to 40 of about 2,517,848 (305)
Efficient Subspace Approximation Algorithms [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nariankadu D. Shyamalkumar +1 more
openaire +2 more sources
Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems [PDF]
When ties and incomplete preference lists are permitted in the Stable Marriage and Hospitals/Residents problems, stable matchings can have different sizes.
Irving, R.W. +3 more
core +1 more source
Scalability of Betweenness Approximation Algorithms: An Experimental Review
Betweenness centrality, which measures the contribution of an individual node to the network's connectivity by counting the number of shortest paths a node appears in, is widely used for the analysis of the complex networks.
Sebastian Wandelt +2 more
doaj +1 more source
Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut [PDF]
In this work, we study the trade-off between the running time of approximation algorithms and their approximation guarantees. By leveraging a structure of the "hard" instances of the Arora-Rao-Vazirani lemma [Sanjeev Arora et al., 2009; James R.
Trevisan, Luca, Manurangsi, Pasin
core +1 more source
Rational approximation of discrete data with asymptomatic behaviour [PDF]
This thesis is concerned with the least-squares approximation of discrete data that appear to exhibit asymptotic behaviour. In particular, we consider using rational functions as they are able to display a number of types of asymptotic behaviour.
Cooper, Philip
core +4 more sources
Approximation Algorithms for Intersection Graphs [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Frank Kammer, Torsten Tholey
openaire +5 more sources
Hardness of approximation for orthogonal rectangle packing and covering problems [PDF]
Bansal and Sviridenko [N. Bansal, M. Sviridenko, New approximability and inapproximability results for 2-dimensional bin packing, in: Proceedings of the 15th Annual ACM–SIAM Symposium on Discrete Algorithms, SODA, 2004, pp.
Chlebikova, Janka +3 more
core +1 more source
Edit Distance with Block Deletions
Several variants of the edit distance problem with block deletions are considered. Polynomial time optimal algorithms are presented for the edit distance with block deletions allowing character insertions and character moves, but without block moves.
Dana Shapira, James A. Storer
doaj +1 more source
The AAA Algorithm for Rational Approximation [PDF]
We introduce a new algorithm for approximation by rational functions on a real or complex set of points, implementable in 40 lines of MATLAB and requiring no user input parameters. Even on a disk or interval the algorithm may outperform existing methods, and on more complicated domains it is especially competitive. The core ideas are (1) representation
Yuji Nakatsukasa +2 more
openaire +4 more sources
Parameterized Approximation Algorithms for TSP [PDF]
We study the Traveling Salesman problem (TSP), where given a complete undirected graph G = (V,E) with n vertices and an edge cost function c:E↦R_{⩾0}, the goal is to find a minimum-cost cycle visiting every vertex exactly once.
Guo, Jiong, Zhou, Jianqi, Li, Peihua
core +1 more source

