Results 11 to 20 of about 6,450,253 (299)
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.
Mohit Singh, K. Talwar
semanticscholar +4 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.
Robin Eßmann +3 more
doaj +5 more sources
Verified Approximation Algorithms [PDF]
Automated Reasoning, 2020 We present the first formal verification of approximation algorithms for NP-complete optimization problems: vertex cover, independent set, load balancing, and bin packing. We uncover incompletenesses in existing proofs and improve the approximation ratio in one case.
Eßmann R, Nipkow T, Robillard S.
europepmc +5 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 for combinatorial problems
Proceedings of the fifth annual ACM symposium on Theory of computing - STOC '73, 1973 Simple, polynomial-time, heuristic algorithms for finding approximate solutions to various polynomial complete optimization problems are analyzed with respect to their worst case behavior, measured by the ratio of the worst solution value that can be chosen by the algorithm to the optimal value.
David S. Johnson
semanticscholar +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
Approximation Algorithms for Sorting λ-Permutations by λ-Operations
Algorithms, 2021 Understanding how different two organisms are is one question addressed by the comparative genomics field. A well-accepted way to estimate the evolutionary distance between genomes of two organisms is finding the rearrangement distance, which is the ...
Guilherme Henrique Santos Miranda +3 more
doaj +1 more source
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
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