Related papers: A note on linear fractional set packing problem
In this paper we identify some inaccuracies in the paper by R.R. Saxena and S.R. Arora, A Linearization technique for solving the Quadratic Set Covering Problem, Optimization, 39 (1997) 33-42. In particular, we observe that their algorithm…
In this paper, we show that the stability analysis in the paper A note on stability of fractional logistic maps, Appl. Math. Lett. 125 (2022) 107787 is incorrect and repeat a proof of a theorem on the convergence of a convolution of the…
This is a list of corrections for the book: J. Noguchi and T. Ochiai, Geometric Function Theory in Several Complex Variables, xi + 282 pp., Math.\ Monographs Vol.\ {\bf 80}, Amer.\ Math.\ Soc., Providence, 1990. The authors hope that this…
In this paper, a detrimental mathematical mistake is pointed out in the proof of \textit{Theorem 1} presented in the paper\textit{ [Generalization of the gradient method with fractional order gradient direction, J. Franklin Inst., 357…
Column-sparse packing problems arise in several contexts in both deterministic and stochastic discrete optimization. We present two unifying ideas, (non-uniform) attenuation and multiple-chance algorithms, to obtain improved approximation…
The purpose of the paper is to rectify a series of errors occurred in [2], [17], [20] for a particular situation. To get a fruitful solution and to overcome the issue, we introduce a new form of set sharing namely restricted set sharing,…
We apply a recent one-dimensional algorithm for predicting random close packing fractions of polydisperse hard spheres [Farr and Groot, J. Chem. Phys. 133, 244104 (2009)] to the case of lognormal distributions of sphere sizes and mixtures…
We consider set covering problems where the underlying set system satisfies a particular replacement property w.r.t. a given partial order on the elements: Whenever a set is in the set system then a set stemming from it via the replacement…
The method, proposed in \cite{Za22} to derive the densest packing fraction of random disc and sphere packings, is shown to yield in two dimensions too high a value that (i) violates the very assumption underlying the method and (ii)…
In this paper, some points to the convergence analysis performed in the paper [A new computing approach for power signal modeling using fractional adaptive algorithms, ISA Transactions 68 (2017) 189-202] are presented. It is highlighted…
We correct mistakes in the paper Kuhlmann, F.-V.: Value groups, residue fields and bad places of rational function fields, Trans. Amer. Math. Soc. 356 (2004) [arXiv:1003.5685] and report on recent new developments which settle cases left…
The band-gap problem and other systematic failures of approximate functionals are explained from an analysis of total energy for fractional charges. The deviation from the correct intrinsic linear behavior in finite systems leads to…
In this Note, we provide the comments on the paper [A note on the hit problem for the polynomial algebra in the case of odd primes and its application] which was published in the RACSAM [Rev. Real. Acad. Cienc. Exactas. Fis. Nat. Ser.…
A Comment by R. Blumenfeld on our recent analytical solution for the random close packing density [A. Zaccone, Phys. Rev. Lett. 128, 028002 (2022)] is shown to be plagued by important errors and to contain incorrect statements.
This paper presents the fractional trigonometric functions in complex-valued space and proposes a short outline of local fractional calculus of complex function in fractal spaces.
We generalize the fractional packing framework of Garg and Koenemann to the case of linear fractional packing problems over polyhedral cones. More precisely, we provide approximation algorithms for problems of the form $\max\{c^T x : Ax…
The present note points out a number of errors, omissions, redundancies and arbitrary deviations from the standard terminology in the paper "Resource placement in Cartesian product of networks," by N. Imani, H. Sarbazi-Azad and A.Y. Zomaya…
Mixed packing and covering problems are problems that can be formulated as linear programs using only non-negative coefficients. Examples include multicommodity network flow, the Held-Karp lower bound on TSP, fractional relaxations of set…
The authors in \cite{alikhani} have given two examples to illustrate their results in which they have been eliminated the technical details. However, the authors in \cite{salahshur} claimed that the examples are incorrect. In fact they…
We study several variations of line segment covering problem with axis-parallel unit squares in $I\!\!R^2$. A set $S$ of $n$ line segments is given. The objective is to find the minimum number of axis-parallel unit squares which cover at…