Results 1 to 10 of about 138,571 (166)
An efficient 3-approximation algorithm for the Steiner tree problem with the minimum number of Steiner points and bounded edge length. [PDF]
PLoS ONE, 2023 We present improved algorithms for the Steiner tree problem with the minimum number of Steiner points and bounded edge length. Given n terminal points in a 2D Euclidean plane and an edge length bound, the problem asks to construct a spanning tree of n ...
Donghoon Shin, Sunghee Choi
doaj +2 more sources
The AAA Algorithm for Rational Approximation [PDF]
SIAM Journal of Scientific Computing, 2018 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
exaly +5 more sources
Verified Approximation Algorithms [PDF]
Logical Methods in Computer Science, 2022 We present the first formal verification of approximation algorithms for NP-complete optimization problems: vertex cover, independent set, set cover, center selection, load balancing, and bin packing. We uncover incompletenesses in existing proofs and improve the approximation ratio in one case. All proofs are uniformly invariant based.
Robin Eßmann +3 more
openaire +8 more sources
Efficient Streaming Algorithms for Maximizing Monotone DR-Submodular Function on the Integer Lattice
Mathematics, 2022 In recent years, the issue of maximizing submodular functions has attracted much interest from research communities. However, most submodular functions are specified in a set function.
Bich-Ngan T. Nguyen +3 more
doaj +1 more source
On the Embed and Project Algorithm for the Graph Bandwidth Problem
Mathematics, 2021 The graph bandwidth problem, where one looks for a labeling of graph vertices that gives the minimum difference between the labels over all edges, is a classical NP-hard problem that has drawn a lot of attention in recent decades. In this paper, we focus
Janez Povh
doaj +1 more source
Mathematics, 2023 As a consequence of e-commerce development, large quantities of returned goods are shipped every day. The vehicle routing problem with simultaneous delivery and pickup (VRPSDP) has become one of the most important areas of logistics management.
Qinge Guo, Nengmin Wang
doaj +1 more source
An approximate search algorithm for the student-internship allocation problem
Tạp chí Khoa học, 2022 This paper proposes an approximate search algorithm to solve the student-internship allocation problem. The key idea of the algorithm is that in each iteration, each student unassigned to an enterprise will be assigned to an enterprise where the student
NGUYEN Quang Ninh +2 more
doaj +1 more source
Approximation algorithms [PDF]
Proceedings of the National Academy of Sciences, 1997 Increasing global competition, rapidly changing markets, and greater consumer awareness have altered the way in which corporations do business. To become more efficient, many industries have sought to model some operational aspects by gigantic optimization problems. It is not atypical to encounter models that capture 10 6
Schulz, Andreas S. +2 more
openaire +2 more sources
Approximation algorithm for the multicovering problem [PDF]
Journal of Combinatorial Optimization, 2021 Let $\mathcal{H}=(V,\mathcal{E})$ be a hypergraph with maximum edge size $\ell$ and maximum degree $Δ$. For given numbers $b_v\in \mathbb{N}_{\geq 2}$, $v\in V$, a set multicover in $\mathcal{H}$ is a set of edges $C \subseteq \mathcal{E}$ such that every vertex $v$ in $V$ belongs to at least $b_v$ edges in $C$. Set Multicover is the problem of finding
Abbass Gorgi +3 more
openaire +2 more sources
An Approximation Algorithm for Approximation Rank [PDF]
2009 24th Annual IEEE Conference on Computational Complexity, 2009 One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix--the minimum rank of a matrix which is entrywise close to the communication matrix.
Troy Lee, Adi Shraibman
openaire +2 more sources