Related papers: Optimal partitions for the sum and the maximum of …

The benefits of a recently proposed method to approximate hard optimization problems are demonstrated on the graph partitioning problem. The performance of this new method, called Extremal Optimization, is compared to Simulated Annealing in…

We provide a two-sided inequality for the alpha-optimal partition value of a measurable space according to n nonatomic finite measures. The result extends and often improves Legut (1988) since the bounds are obtained considering several…

The extremal eigenvalues including maximum eigenvalues and the minimum eigenvalues about outerplanar graphs are investigated in this paper. Some structural characterizations about the (edge) maximal bipartite outerplanar graphs are…

The objective here is to find the maximum polygon, in area, which can be enclosed in a given triangle, for the polygons: parallelograms, rectangles and squares. It will initially be assumed that the choices are inscribed polygons, that is…

Finding nonoverlapping balls with given centers in any metric space, maximizing the sum of radii of the balls, can be expressed as a linear program. Its dual linear program expresses the problem of finding a minimum-weight set of cycles…

The discrete Laplace operator on a triangulated polyhedral surface is related to geometric properties of the surface. This paper studies extremum problems for eigenvalues of the discrete Laplace operators. Among all triangles, an…

We analyze "Neumann" spectral minimal partitions for a thin strip on a cylinder or for the thin annulus.

We consider the minimum-cut partitioning of a graph into more than two parts using spectral methods. While there exist well-established spectral algorithms for this problem that give good results, they have traditionally not been well…

This paper studies the problem of selecting a submatrix of a positive definite matrix in order to achieve a desired bound on the smallest eigenvalue of the submatrix. Maximizing this smallest eigenvalue has applications to selecting input…

We study partitions on three dimensional manifolds which minimize the total geodesic perimeter. We propose a relaxed framework based on a $\Gamma$-convergence result and we show some numerical results. We compare our results to those…

Given a multi-variant polynomial inequality with a parameter, how to find the best possible value of this parameter that satisfies the inequality? For instance, find the greatest number $k$ that satisfies $ a^3+b^3+c^3+…

The problem of multiway partitioning of an undirected graph is considered. A spectral method is used, where the k > 2 largest eigenvalues of the normalized adjacency matrix (equivalently, the k smallest eigenvalues of the normalized graph…

Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…

We formalize a new paradigm for optimality of algorithms, that generalizes worst-case optimality based only on input-size to problem-dependent parameters including implicit ones. We re-visit some existing sorting algorithms from this…

We study extrema of the first and the second mixed eigenvalues of the Laplacian on the disk among some families of Dirichlet-Neumann boundary conditions. We show that the minimizer of the second eigenvalue among all mixed boundary…

In this paper we propose a variant of the linear least squares model allowing practitioners to partition the input features into groups of variables that they require to contribute similarly to the final result. The output allows…

We study a version of the metric facility location problem (or, equivalently, variants of the committee selection problem) in which we must choose $k$ facilities in an arbitrary metric space to serve some set of clients $C$. We consider…

In this paper, we introduce two iterative methods for longest minimal length partition problem, which asks whether the disc (ball) is the set maximizing the total perimeter of the shortest partition that divides the total region into…

New algorithms are devised for finding the maxima of multidimensional point samples, one of the very first problems studied in computational geometry. The algorithms are very simple and easily coded and modified for practical needs. The…

We study partitions of the rectangular two-dimensional flat torus of length 1 and width b into k domains, with b a parameter in (0, 1] and k an integer. We look for partitions which minimize the energy, definedas the largest first…