Výsledky vyhľadávania - Mathematics of computing → Approximation algorithms

Metro Maps on Octilinear Grid Graphs Autor Bast, Hannah, Brosi, Patrick, Storandt, Sabine

“…Schematic transit maps (often called “metro maps” in the literature) are important to produce comprehensible visualizations of complex public transit networks…”
Získať plný text

Finding Spatial Clusters Susceptible to Epidemic Outbreaks due to Undervaccination Autor Cadena, Jose, Marathe, Achla, Vullikanti, Anil

“… We focus on finding clusters that maximize this measure and develop efficient approximation algorithms for finding critical clusters by exploiting structural properties of the problem…”
Získať plný text

Algorithms for computing the approximation of offsets of toric Bézier curves Autor Zhao, Xuanyi, Wang, Ying, Li, Jinggai, Zhu, Chungang

“…Algorithms for curve offsetting are of great importance in computer-aided design, computer-aided manufacture, and numerical control of machines…”
Získať plný text

A new algorithm for computing path integrals and weak approximation of SDEs inspired by large deviations and Malliavin calculus Autor Yamada, Toshihiro

“… The proposed finite-dimensional approximation of integrals on path space will be a new higher-order weak approximation of multidimensional stochastic differential equations where the dominant part…”
Získať plný text

Re-imaginig the Networks: Detecting Local Communities in Networks by Approximating Derivatives in Graph Space Autor Rigi, M. Amin, Moser, Irene, Rigi, Seddigh, Liu, Chengfei

“…Finding communities in networks has become very important because various social and physical complex systems are represented as networks. Because of their…”
Získať plný text

Improving the generality of the fictitious magnetic charge approach to computing inductances in the presence of permeable materials Autor Massoud, Yehia, White, Jacob

“…In this paper we present an improvement to the fictitious magnetic charge approach to computing inductances in the presence of permeable materials…”
Získať plný text

Inversion Fractals and Iteration Processes in the Generation of Aesthetic Patterns Autor Gdawiec, K.

“…—which is similar to the inversion fractals generation algorithm—the proposed generalizations do not give interesting results…”
Získať plný text

Approximation algorithms for MAX RES CUT with limited unbalanced constraints Autor Ling, Aifan, Tang, Le, Xu, Chengxian

“… Approximation algorithms used in Frieze and Jerrum (Integer Programming and Combinatorial Optimization, vol. 920, pp. 1…”
Získať plný text

Fast algorithm based on the novel approximation formula for the Caputo-Fabrizio fractional derivative Autor Liu, Yang, Fan, Enyu, Yin, Baoli, Li, Hong

“…)$ memory storage, where $M$ denotes the numbers of divided intervals. To improve the efficiency, we further develop a fast algorithm based on the novel approximation technique that reduces the computing complexity from $O(M^2)$ to $O(M…”
Získať plný text

The Traveling Salesman Problem: A Computational Study Autor Applegate, David L, Bixby, Robert E, Chvátal, Vašek, Cook, William J

“…This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem…”
Získať plný text

Recent advances in trust region algorithms Autor Yuan, Ya-xiang

“… is minimized within a trust region. Due to the trust region constraint, nonconvex models can be used in trust region subproblems, and trust region algorithms can be applied to nonconvex and ill-conditioned problems…”
Získať plný text

A fast (2+27)-approximation algorithm for capacitated cycle covering Autor Traub, Vera, Tröbst, Thorben

“… We show that a greedy algorithm followed by a post-processing step yields a ( 2 + 2 7 ) -approximation for this problem by comparing the solution to a polymatroid relaxation…”
Získať plný text

The golden ticket: P, NP, and the search for the impossible Autor Fortnow, Lance

“…The P-NP problem is the most important open problem in computer science, if not all of mathematics.The Golden Ticketprovides a nontechnical introduction to…”
Získať plný text

Scientific Machine Learning Through Physics–Informed Neural Networks: Where we are and What’s Next Autor Cuomo, Salvatore, Di Cola, Vincenzo Schiano, Giampaolo, Fabio, Rozza, Gianluigi, Raissi, Maziar, Piccialli, Francesco

“…Physics-Informed Neural Networks (PINN) are neural networks (NNs) that encode model equations, like Partial Differential Equations (PDE), as a component of the…”
Získať plný text

A tight approximation algorithm for the cluster vertex deletion problem Autor Aprile, Manuel, Drescher, Matthew, Fiorini, Samuel, Huynh, Tony

“…We give the first 2-approximation algorithm for the cluster vertex deletion problem…”
Získať plný text

Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions Autor Wang, Mengdi, Fang, Ethan X., Liu, Han

“…) algorithms that can be viewed as stochastic versions of quasi-gradient method. SCGD update the solutions based on noisy sample gradients of f v , g w and use an auxiliary variable to track the unknown quantity E w g w ( x…”
Získať plný text

Approximation algorithms for flexible graph connectivity Autor Boyd, Sylvia, Cheriyan, Joseph, Haddadan, Arash, Ibrahimpur, Sharat

“…We present approximation algorithms for several network design problems in the model of flexible graph connectivity (Adjiashvili et al., in: IPCO, pp 13…”
Získať plný text

Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization Autor Ghadimi, Saeed, Lan, Guanghui, Zhang, Hongchao

“…) algorithm, in which proper mini-batch of samples are taken at each iteration depending on the total budget of stochastic samples allowed…”
Získať plný text

Exact and approximation algorithms for routing a convoy through a graph: Exact and approximation algorithms for routing a convoy through a graph Autor van Ee, Martijn, Oosterwijk, Tim, Sitters, René, Wiese, Andreas

“…We study routing problems of a convoy in a graph, generalizing the shortest path problem (SPP), the travelling salesperson problem (TSP), and the Chinese…”
Získať plný text

Robust vertex enumeration for convex hulls in high dimensions Autor Awasthi, Pranjal, Kalantari, Bahman, Zhang, Yikai

“…), a robust and efficient algorithm for this problem. On the one hand, without any assumptions, AVTA computes approximation to the subset…”
Získať plný text