Related papers: A Ptolemaic Partitioning Mechanism
Comparing and computing distances between phylogenetic trees are important biological problems, especially for models where edge lengths play an important role. The geodesic distance measure between two phylogenetic trees with edge lengths…
An exact algorithm is presented for solving edge weighted graph partitioning problems. The algorithm is based on a branch and bound method applied to a continuous quadratic programming formulation of the problem. Lower bounds are obtained…
In this paper, we give a detailed account of the algorithm outlined in [1] for Feynman integral reduction and $\varepsilon$-factorised differential equations. The algorithm consists of two steps. In the first step, we use a new geometric…
One of the most important quantum algorithms ever discovered is Grover's algorithm for searching an unordered set. We give a new lower bound in the query model which proves that Grover's algorithm is exactly optimal. Similar to existing…
In the past few years, a successful line of research has lead to lower bounds for several fundamental local graph problems in the distributed setting. These results were obtained via a technique called round elimination. On a high level,…
We introduce an efficient and scalable method for density-based multi-material topology optimization, integrating classical mirror descent techniques with point-wise polytopal design constraints. Such constraints arise naturally in this…
Recent observations have been made that bridge splitting methods arising from optimization, to the Hopf and Lax formulas for Hamilton-Jacobi Equations with Hamiltonians $H(p)$. This has produced extremely fast algorithms in computing…
In this paper we propose a product space reformulation to transform monotone inclusions described by finitely many operators on a Hilbert space into equivalent two-operator problems. Our approach relies on Pierra's classical reformulation…
We introduce a universal approach for applying the partition rank method, an extension of Tao's slice rank polynomial method, to tensors that are not diagonal. This is accomplished by generalizing Naslund's distinctness indicator to what we…
We study a convex resource allocation problem in which lower and upper bounds are imposed on partial sums of allocations. This model is linked to a large range of applications, including production planning, speed optimization, stratified…
Proportional apportionment is the problem of assigning seats to parties according to their relative share of votes. Divisor methods are the de-facto standard solution, used in many countries. In recent literature, there are two algorithms…
Since its inception, Benders Decomposition (BD) has been successfully applied to a wide range of large-scale mixed-integer (linear) problems. The key element of BD is the derivation of Benders cuts, which are often not unique. In this…
Global polynomial optimization methods typically rely on compactness of the feasible region in order to find solutions. These methods can incur considerable computational expense and most commercially available solvers do not verify the…
We consider a variant of treewidth that we call clique-partitioned treewidth in which each bag is partitioned into cliques. This is motivated by the recent development of FPT-algorithms based on similar parameters for various problems. With…
We present a novel algorithm for the minimum-depth elimination tree problem, which is equivalent to the optimal treedepth decomposition problem. Our algorithm makes use of two cheaply-computed lower bound functions to prune the search tree,…
The detection of entanglement in a bipartite state is a crucial issue in quantum information science. Based on realignment of density matrices and the vectorization of the reduced density matrices, we introduce a new set of separability…
In this paper, we introduce a system of split variational inequality problems in real Hilbert spaces. Using projection method, we propose an iterative algorithm for the system of split variational inequality problems. Further, we prove that…
Although many machine learning algorithms involve learning subspaces with particular characteristics, optimizing a parameter matrix that is constrained to represent a subspace can be challenging. One solution is to use Riemannian…
Achieving tight bounding boxes of a shape while guaranteeing complete boundness is an essential task for efficient geometric operations and unsupervised semantic part detection. But previous methods fail to achieve both full coverage and…
This paper proposes an algorithm for clipping line segment against an axis-aligned rectangular window. The conventional algorithms for line segment clipping treat the clipping boundary and/or the line segment to be clipped as line. The…