Related papers: A note on linear fractional set packing problem
R\'enyi's parking problem (or $1D$ sequential interval packing problem) dates back to 1958, when R\'enyi studied the following random process: Consider an interval $I$ of length $x$, and sequentially and randomly pack disjoint unit…
This paper discusses and summarizes some results on complex variables that are very useful in fractional-order systems analysis and design, specifically when the system is analyzed in the frequency domain. The author hopes that this…
This two-part paper develops novel methodologies for using fractional programming (FP) techniques to design and optimize communication systems. Part I of this paper proposes a new quadratic transform for FP and treats its application for…
We prove a size-sensitive version of Haussler's Packing lemma~\cite{Haussler92spherepacking} for set-systems with bounded primal shatter dimension, which have an additional {\em size-sensitive property}. This answers a question asked by…
The Random Sequential Adsorption (RSA) problem holds crucial theoretical and practical significance, serving as a pivotal framework for understanding and optimizing particle packing in various scientific and technological applications. Here…
Recently, the class of Runge-Kutta type methods named Fractional HBVMs (FHBVMs) has been introduced for the numerical solution of initial value problems of fractional differential equations, and a corresponding Matlab software has been…
In reversible computing, the management of space is subject to two broad classes of constraints. First, as with general-purpose computation, every allocation must be paired with a matching de-allocation. Second, space can only be safely…
This paper studies approximate solutions of a linear fractional vector optimization problem without requiring boundedness of the constraint set. We establish necessary and sufficient conditions for approximating weakly efficient points of…
We consider the problem of covering multiple submodular constraints. Given a finite ground set $N$, a cost function $c: N \rightarrow \mathbb{R}_+$, $r$ monotone submodular functions $f_1,f_2,\ldots,f_r$ over $N$ and requirements…
This note is to publicly answer to a paper recently accepted to SWAT 2020 [1] that claims to have solved an error in our papers [3,2] by proposing a solution with worst performances. In the following section we describe in detail sections…
This Ph.D. thesis contains original contributions to several areas within the disciplines of disordered systems, numerical linear algebra, and scientific computing: (1) Theoretical and numerical study of the errors caused by using certain…
Given a collection S of subsets of some set U, and M a subset of U, the set cover problem is to find the smallest subcollection C of S such that M is a subset of the union of the sets in C. While the general problem is NP-hard to solve,…
An algorithm for the estimation of multiple targets from partial and corrupted observations is introduced based on the concept of partially-distinguishable multi-target system. It combines the advantages of engineering solutions like MHT…
The referred-to paper on antiproton production contains two errors: an error in the value reported for one of the fit parameters and an error in units. I give the errors and the corrected values when possible.
We introduce the notion of r-defectivity for a vector bundle on a quasi-projective variety. Using this tool, we prove several previously unknown cases of Fr\"oberg's conjecture and also of the postulation problem for fat point schemes. Our…
We study the problem of multiset prediction. The goal of multiset prediction is to train a predictor that maps an input to a multiset consisting of multiple items. Unlike existing problems in supervised learning, such as classification,…
There are errors in the algorithm proposed by Narendra Chaudhari [2] purporting to solve the 3-sat problem in polynomial time. The present paper present instances for which the algorithm outputs erroneous results.
We describe a novel algorithm for rounding packing integer programs based on multidimensional Brownian motion in $\mathbb{R}^n$. Starting from an optimal fractional feasible solution $\bar{x}$, the procedure converges in polynomial time to…
We find sufficient conditions on a set $\mathscr{M}\subset\mathbf{R}^n\times\mathscr{L}(\mathbf{R}^n,\mathbf{R}^m)$ ensuring that the set of functions such that $(F(x),DF(x))\in\mathscr{M}$ is rectifiable. We also prove a more general…
The aim of this paper is to establish an abstract theory based on the so-called fractional-maximal distribution functions (FMDs). From the rough ideas introduced in~\cite{AM2007}, we develop and prove some abstract results related to the…