A pseudo-polynomial time O(log² n)-approximation algorithm for art gallery problems by Deshpande, Ajay A

Get full text

An O(log n/log log n)-approximation algorithm for the asymmetric traveling salesman problem by Asadpour, Arash, Goemans, Michel X., Madry, Aleksander, Gharan, Shayan Oveis, Saberi, Amin

Get full text
Get full text
Get full text

A tutorial on stochastic approximation algorithms for training Restricted Boltzmann Machines and Deep Belief Nets by Swersky, K, Chen, B, Marlin, B, de Freitas, N

A Performance Study of Some Approximation Algorithms for Computing a Small Dominating Set in a Graph by Jonathan Li, Rohan Potru, Farhad Shahrokhi

“…We implement and test the performances of several approximation algorithms for computing the minimum dominating set of a graph. …”
Get full text

A simple polynomial-time approximation algorithm for the total variation distance between two product distributions by Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang

“…We give a simple polynomial-time approximation algorithm for the total variation distance between two product distributions.…”
Get full text

Modified Fast Inverse Square Root and Square Root Approximation Algorithms: The Method of Switching Magic Constants by Leonid V. Moroz, Volodymyr V. Samotyy, Oleh Y. Horyachyy

Get full text

W-SPSA : an Efficient Stochastic Approximation Algorithm for the off-line calibration of Dynamic Traffic Assignment models by Lu, Lu, S.M. Massachusetts Institute of Technology

Get full text

Scelestial: Fast and accurate single-cell lineage tree inference based on a Steiner tree approximation algorithm. by Mohammad-Hadi Foroughmand-Araabi, Sama Goliaei, Alice C McHardy

“…We describe a method, Scelestial, for lineage tree reconstruction from single-cell data, which is based on an approximation algorithm for the Steiner tree problem and is a generalization of the neighbor-joining method. …”
Get full text

An efficient 3-approximation algorithm for the Steiner tree problem with the minimum number of Steiner points and bounded edge length. by Donghoon Shin, Sunghee Choi

“…The best-known deterministic approximation algorithm has O(n3) running time with an approximation ratio of 3. …”
Get full text

An efficient 3-approximation algorithm for the Steiner tree problem with the minimum number of Steiner points and bounded edge length by Donghoon Shin, Sunghee Choi

Get full text

Optimal stopping of Markov processes : Hilbert space theory, approximation algorithms, and an application to pricing high-dimensional financial derivatives

Get full text

An overview on polynomial approximation of NP-hard problems by Paschos Vangelis Th.

Subjects: Get full text

Profit Maximization for Viral Marketing in Online Social Networks by Tang, Jing, Tang, Xueyan, Yuan, Junsong

Subjects: Get full text
Get full text

Algorithm of Quasiuniform Filling of Reachable Set for Nonlinear Control System by E. Finkelstein, A. Gornov

Subjects: Get full text

Single Machine Scheduling with Release Dates by Goemans, Michel X., Queyranne, Maurice, Schulz, Andreas S., Skutella, Martin, Wang, Yaoguang

Subjects: “…approximation algorithm, LP relaxation, scheduling, online algorithm…”
Get full text

Towards the Solution of NP Complete Problems by Amit Kumar, Pawan Jindal

Subjects: “…Approximation algorithms…”
Get full text

Bandwidth Cost Minimization via User Association for Enterprise WLANs by Xili Wan, Xinjie Guan, Wentian Zhao, Guangwei Bai, Baek-Young Choi

Subjects: Get full text

An experimental comparison of some heuristics for cardinality constrained bin packing problem by Maja Remic, Gašper Žerovnik, Janez Žerovnik

Subjects: Get full text

An approximate search algorithm for the student-internship allocation problem by NGUYEN Quang Ninh, DINH Van Nam, HOANG Huu Viet

Subjects: Get full text

Drones Routing with Stochastic Demand by Nan Yu, Bin Dong, Yuben Qu, Mingwei Zhang, Yanyan Wang, Haipeng Dai, Changhua Yao

Subjects: Get full text