Sampling-Based Approximation Algorithms for Reachability Analysis with Provable Guarantees by Liebenwein, Lucas, Baykal, Cenk, Gilitschenski, Igor, Karaman, Sertac, Rus, Daniela L

Get full text
Get full text
Get full text
Get full text
Get full text

Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces by Sidiropoulos, Anastasios, Badoiu, Mihai, Dhamdhere, Kedar, Gupta, Anupam, Indyk, Piotr, Rabinovich, Yuri, Racke, Harald, Ravi, R

“…© 2019 Society for Industrial and Applied Mathematics We present several approximation algorithms for the problem of embedding metric spaces into a line, and into the 2-dimensional plane. …”
Get full text

Conditionally optimal approximation algorithms for the girth of a directed graph by Dalirrooyfard, Mina, Williams, Virginia Vassilevska

“…Fast good quality approximation algorithms for undirected graphs have been known for decades. …”
Get full text

Tight approximation algorithms for bichromatic graph diameter and related problems by Dalirrooyfard, Mina, Williams, Virginia Vassilevska, Vyas, Nikhil, Wein, Nicole

“…We give the first nontrivial approximation algorithms for most of these problems, including time/accuracy trade-off upper and lower bounds. …”
Get full text

Polylogarithmic Approximation Algorithm for Non-Uniform Multicommodity Buy-at-Bulk by Hajiaghayi, MohammadTaghi, Kortsarz, Guy, Salavatipour, Mohammad R.

“…Thefirstnon-trivial approximation algorithm for this problem is due toCharikarand Karagiozova (STOC' 05) whose algorithm has anapproximation guarantee of$\exp(O(\sqrt{\log n\log\log n}))$,when all $\delta_i=1$ and$\exp(O(\sqrt{\log N\log\log N}))$ for the generaldemand case where $N$ isthe sum of all demands. …”
Get full text

Approximation algorithms for low-distortion embeddings into low-dimensional spaces by Sidiropoulos, Anastasios

Get full text

A multiscale approximation algorithm for the cardinality constrained knapsack problem by Krishnan, Bharath Kumar

Get full text

Interactive proof system variants and approximation algorithms for optical networks by Sundaram, Ravi, 1968-

Get full text

Reducing Revenue to Welfare Maximization: Approximation Algorithms and Other Generalizations by Cai, Yang, Daskalakis, Konstantinos, Weinberg, Seth Matthew

“…In this paper, we extend the reduction to accommodate approximation algorithms, providing an approximation preserving reduction from (truthful) revenue maximization to (not necessarily truthful) welfare maximization. …”
Get full text
Get full text

Efficient distributed approximation algorithms via probabilistic tree embeddings by Khan, Maleq., Kuhn, Fabian., Malkhi, Dahlia., Pandurangan, Gopal., Talwar, Kunal.

“…We present a uniform approach to design efficient distributed approximation algorithms for various fundamental network optimization problems. …”
Get full text
Get full text

Adaptive Galerkin approximation algorithms for Kolmogorov equations in infinite dimensions by Schwab, C, Süli, E

“…All constants in our error and complexity bounds are shown to be independent of the number of “active” coordinates identified by the proposed adaptive Galerkin approximation algorithms. The computational work and memory required by the proposed algorithms scale linearly with the support size of the coefficient vectors that arise in the approximations, with dimension-independent constants.…”

An Introduction to Development of Centralized and Distributed Stochastic Approximation Algorithm with Expanding Truncations by Wenxiao Zhao

Subjects: “…stochastic approximation algorithm…”
Get full text

Approximation Algorithms for Multicoloring Planar Graphs and Powers of Square and Triangular Meshes by Mustapha Kchikech, Olivier Togni

“…We first propose an 11/6-approximation algorithm for multicoloring any weighted planar graph. …”
Get full text

Efficiency comparison of exact and approximate algorithms for solving set covering problem by Igor S. Konovalov, Sergey S. Ostapenko, Valery G. Kobak

“…Techniques of the set covering problem solution by exact and approximate algorithms are considered. The genetic algorithm is used as the approximate method, and the branch and bounds algorithm - as the exact method. …”
Get full text

A simple greedy approximation algorithm for the unit disk cover problem by Mahdi Imanparast, Seyed Naser Hashemi

Subjects: Get full text

Continuous symmetry and chirality measures: approximate algorithms for large molecular structures by Gil Alon, Yuval Ben-Haim, Inbal Tuvi-Arad

Get full text

Aggregation of Demand-Side Flexibilities: A Comparative Study of Approximation Algorithms by Emrah Öztürk, Klaus Rheinberger, Timm Faulwasser, Karl Worthmann, Markus Preißinger

“…The main contribution of this paper is a comparative evaluation of several approximation algorithms in terms of novel quality criteria, computational complexity, and communication effort using realistic data. …”
Get full text

Approximation algorithms for multi-multiway cut and multicut problems on directed graphs by Ramin Yarinezhad, Seyed Naser Hashemi

Subjects: “…approximation algorithm…”
Get full text

An Effective Approximation Algorithm for Second-Order Singular Functional Differential Equations by Mohammad Izadi, Hari M. Srivastava, Waleed Adel

Get full text

An approximation algorithm for the at least version of the generalized minimum spanning tree problem by Petrică C. Pop, Andrei Horvat-Marc, Corina Pop Sitar

Subjects: “…approximation algorithms…”
Get full text