Results 1 to 10 of about 2,132,547 (303)
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.
Robin Eßmann +3 more
doaj +8 more sources
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms
Algorithms, 2020 Parameterization and approximation are two popular ways of coping with NP-hard problems. More recently, the two have also been combined to derive many interesting results.
Andreas Emil Feldmann +3 more
doaj +3 more sources
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
Schulz, Andreas S. +2 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 +4 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 +3 more sources
An overview on polynomial approximation of NP-hard problems [PDF]
Yugoslav Journal of Operations Research, 2009 The fact that polynomial time algorithm is very unlikely to be devised for an optimal solving of the NP-hard problems strongly motivates both the researchers and the practitioners to try to solve such problems heuristically, by making a trade-off between
Paschos Vangelis Th.
doaj +1 more source
CES Transactions on Electrical Machines and Systems, 2022 The calculation of square roots is a frequently used operation in control systems of power electronics for different applications: motor drives, power converters, etc. At the same time, the execution of this procedure significantly loads microcontrollers
Anton Dianov +2 more
doaj +1 more source
Approximation Algorithms for Multitasking Scheduling Problems
IEEE Access, 2020 In this work, we incorporate human factors and real-life operations into newly proposed multitasking scheduling problems with periodic shift activities.
Feifeng Zheng +3 more
doaj +1 more source
Influence Circle Covering in Large-Scale Social Networks: A Shift Approach
IEEE Access, 2021 Given a specific propagation speed $h$ in a social network $G(V, E)$ , an influence circle(IC) of a node $s$ in time $t$ is a node set of its influenced nodes, where the distance between $s$ and its expected influenced node $w$ is less than ...
Wangjun Ying, Jian Xu
doaj +1 more source
Coresets for the Average Case Error for Finite Query Sets
Sensors, 2021 Coreset is usually a small weighted subset of an input set of items, that provably approximates their loss function for a given set of queries (models, classifiers, hypothesis). That is, the maximum (worst-case) error over all queries is bounded.
Alaa Maalouf +3 more
doaj +1 more source