Results 31 to 40 of about 5,940,643 (309)
Approximation hardness of dominating set problems in bounded degree graphs [PDF]
, 2008 We study approximation hardness of the Minimum Dominating Set problem and its variants in undirected and directed graphs. Using a similar result obtained by Trevisan for Minimum Set Cover we prove the first explicit approximation lower bounds for various
Chlebikova, Janka +3 more
core +1 more source
Improved (In-)Approximability Bounds for d-Scattered Set
Journal of Graph Algorithms and Applications, 2023 In the $d$-${\rm S{\small CATTERED}\;S{\small ET}}$ problem we are asked to select at least $k$ vertices of a given graph, so that the distance between any pair is at least $d$.
Ioannis Katsikarelis +2 more
doaj +1 more source
Sequential Three-Way Decision of Tolerance- Based Multi-Granularity Fuzzy-Rough Sets
IEEE Access, 2019 The existing three-way decision-making methods are classified into two classes-a single one-step three-way decision-making and a sequential, multi-step three-way decision-making, and this paper studies the latter.
Hong Wang, Xiaohua Chai
doaj +1 more source
Rule induction based on rough sets from information tables having continuous domains
CAAI Transactions on Intelligence Technology, 2019 Information tables having continuous domains are handled by neighborhood rough sets. Two approximations in complete information tables are extended to handle incomplete information.
Michinori Nakata +2 more
doaj +1 more source
Cost-sensitive Multigranulation Approximation of Neighborhood Rough Fuzzy Sets [PDF]
Jisuanji kexue, 2023 Multigranulation neighborhood rough sets are a new data processing mode in the theory of neighborhood rough sets,in which the target concept can be characterized by upper/lower approximate boundaries of optimistic and pessimistic,respectively ...
YANG Jie, KUANG Juncheng, WANG Guoyin, LIU Qun
doaj +1 more source
Hardness of approximation for orthogonal rectangle packing and covering problems [PDF]
, 2009 Bansal and Sviridenko [N. Bansal, M. Sviridenko, New approximability and inapproximability results for 2-dimensional bin packing, in: Proceedings of the 15th Annual ACM–SIAM Symposium on Discrete Algorithms, SODA, 2004, pp.
Chlebikova, Janka +3 more
core +1 more source
Lower bounds for diophantine approximations
Journal of Pure and Applied Algebra, 1997 We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new procedure for the decision of consistency of polynomial equation systems whose bit complexity is subexponential, too. As
Giusti, M. +5 more
openaire +3 more sources
Lower Approximations by Fuzzy Consequence Operators [PDF]
Advances in Intelligent Systems Research, 2015 Peer ...
Elorza Barbajero, Jorge +1 more
openaire +2 more sources
Lower bounds for the low-rank matrix approximation
Journal of Inequalities and Applications, 2017 Low-rank matrix recovery is an active topic drawing the attention of many researchers. It addresses the problem of approximating the observed data matrix by an unknown low-rank matrix. Suppose that A is a low-rank matrix approximation of D, where D and A
Jicheng Li, Zisheng Liu, Guo Li
doaj +1 more source
Lower bounds for simultaneous Diophantine approximation constants [PDF]
, 1955 summary:After a brief exposition of the state-of-art of research on the (Euclidean) simultaneous Diophantine approximation constants $\theta _s$, new lower bounds are deduced for $\theta _6$ and $\theta _7$
Nowak, Werner Georg, J. V. Armitage
core +1 more source