A separable assignment problem (SAP) is defined by a set of bins and a set of items to pack in each bin; a value, f, for assigning item j to bin i; and a separate packing constraint for each bin—i.e., ...

The ATA algorithm provides a novel approximation framework for analytic functions that cannot be expressed in closed-form via elementary or algebraic functions. It introduces a hybrid approximation ...

The state of the art of the design and analysis of approximation algorithms for NP-hard discrete optimization has advanced significantly over the past two decades; furthermore, the most prevalent ...

A comprehensive C++ implementation of the theoretical framework presented in "Efficient Subspace Approximation Algorithms" by Shyamalkumar and Varadarajan, featuring advanced algorithmic optimizations ...

A monthly overview of things you need to know as an architect or aspiring architect. Unlock the full InfoQ experience by logging in! Stay updated with your favorite authors and topics, engage with ...

Abstract: In scheduling theory, the non-preemptive scheduling on a single machine of jobs with increasing processing times and release dates for total completion time minimization is known to be a ...

Abstract: Identifying positive influence dominating set (PIDS) with the smallest cardinality can produce positive effect with the minimal cost on a social network. The purpose of this article is to ...

Institute of Mathematics, National Academy of Sciences of the Republic of Armenia, Yerevan, Armenia. Let’s start with an excursion into the two-century history of studying the classical Fourier series ...

Considering the characteristics of spatial straightness error, this paper puts forward a kind of evaluation method of spatial straightness error using Geometric ...