Search
Now showing items 1-10 of 44
Improved analysis of a max-cut algorithm based on spectral partitioning
(SIAM, 2015)
Trevisan [SIAM J. Comput., 41 (2012), pp. 1769-1786] presented an algorithm for Max-Cut based on spectral partitioning techniques. This is the first algorithm for Max-Cut with an approximation guarantee strictly larger ...
Clique partitioning with value-monotone submodular cost
(Elsevier, 2015)
We consider the problem of partitioning a graph into cliques of bounded cardinality. The goal is to find a partition that minimizes the sum of clique costs where the cost of a clique is given by a set function on the nodes. ...
Instance-optimal geometric algorithms
(ACM, 2017)
We prove the existence of an algorithmAfor computing 2D or 3D convex hulls that is optimal forevery pointsetin the following sense: for every sequenceσofnpoints and for every algorithmA′in a certain classA,the running time ...
Compressed vertical partitioning for efficient RDF management
(Springer, 2015)
The Web of Data has been gaining momentum in recent years. This leads to increasingly publish more and more semi-structured datasets following, in many cases, the RDF (Resource Description Framework) data model based on ...
Development of Supervised Learning Predictive Models for Highly Non-linear Biological, Biomedical, and General Datasets
(Frontiers Media, 2020)
In highly non-linear datasets, attributes or features do not allow readily finding visual patterns for identifying common underlying behaviors. Therefore, it is not possible to achieve classification or regression using ...
Computing the coarseness with strips or boxes
(Elsevier, 2017)
Recently, the concept of coarseness was introduced as a measure of how blended a 2-colored
point set S is. In the definition of this measure, a convex partition Π, that is, a partition
of S into sets {S1, . . . , Sk} of ...
On minimizing the makespan when some jobs cannot be assigned on the same machine
(Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017)
We study the classical scheduling problem of assigning jobs to machines in order to minimize
the makespan. It is well-studied and admits an EPTAS on identical machines and a (2 − 1/m)-
approximation algorithm on unrelated ...
A (5/3 +)-Approximation for unsplittable flow on a path: Placing small tasks into boxes
(Association for Computing Machinery, 2018)
In the unsplittable flow on a path problem (UFP) we are given a
path with edge capacities and a collection of tasks. Each task is
characterized by a subpath, a profit, and a demand. Our goal is to
compute a maximum ...
Approximate String Matching with Compressed Indexes
(2009)
A compressed full-text self-index for a text T is a data structure requiring reduced
space and able to search for patterns P in T. It can also reproduce any substring of T, thus
actually replacing T. Despite the recent ...
Short-term generation planning by primal and dual decomposition techniques
(Universidad Nacional de Colombia (Sede Medellín). Facultad de Minas., 2015-05-01)
This paper addresses the short-term generation planning (STGP) through thermoelectric units. The mathematical model is presented as a Mixed Integer Non Linear Problem (MINLP). Several works on the state of art of the problem ...