Results 11 to 20 of about 1,003,970 (287)
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 +9 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 6
Schulz, Andreas S. +2 more
openaire +3 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
Approximation Algorithms for Hitting Subgraphs [PDF]
, 2021 Let $H$ be a fixed undirected graph on $k$ vertices. The $H$-hitting set problem asks for deleting a minimum number of vertices from a given graph $G$ in such a way that the resulting graph has no copies of $H$ as a subgraph. This problem is a special case of the hypergraph vertex cover problem on $k$-uniform hypergraphs, and thus admits an efficient ...
Noah Brüstle +4 more
openaire +2 more sources
Leveraging Sparse Approximation for Monaural Overlapped Speech Separation From Auditory Perspective
IEEE Access, 2023 Neuroscience suggests that the sparse behavior of a neural population underlies the mechanisms of the auditory system for monaural overlapped speech separation.
Hiroshi Sekiguchi +2 more
doaj +1 more source
Unsupervised Attribute Reduction Algorithm for Mixed Data Based on Fuzzy Optimal Approximation Set
Mathematics, 2023 Fuzzy rough set theory has been successfully applied to many attribute reduction methods, in which the lower approximation set plays a pivotal role. However, the definition of lower approximation used has ignored the information conveyed by the upper ...
Haotong Wen, Shixin Zhao, Meishe Liang
doaj +1 more source
Cost-effectiveness of algorithms [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Discrete ...
Graham Farr
doaj +1 more source
Efficient Algorithms for Max-Weighted Point Sweep Coverage on Lines
Sensors, 2021 As an important application of wireless sensor networks (WSNs), deployment of mobile sensors to periodically monitor (sweep cover) a set of points of interest (PoIs) arises in various applications, such as environmental monitoring and data collection ...
Dieyan Liang, Hong Shen
doaj +1 more source
Efficient Delivery Services Sharing with Time Windows
Applied Sciences, 2020 Delivery service sharing (DSS) has made an important contribution in the optimization of daily order delivery applications. Existing DSS algorithms introduce two major limitations.
Wanyuan Wang, Hansi Tao, Yichuan Jiang
doaj +1 more source