相关论文: An optimal matching problem

Given two point sets S and T, in a many-to-many matching between S and T each point in S is assigned to one or more points in T and vice versa. A generalization of the many-to-many matching problem is the limited capacity many-to-many…

The maximum traveling salesman problem (Max TSP) consists of finding a Hamiltonian cycle with the maximum total weight of the edges in a given complete weighted graph. This problem is APX-hard in the general metric case but admits…

This paper presents a new combinatorial optimisation task, the Subset Sum Matching Problem (SSMP), which is an abstraction of common financial applications such as trades reconciliation. We present three algorithms, two suboptimal and one…

We show that finding minimally intersecting $n$ paths from $s$ to $t$ in a directed graph or $n$ perfect matchings in a bipartite graph can be done in polynomial time. This holds more generally for unimodular set systems.

The maximum-entropy sampling problem is a fundamental and challenging combinatorial-optimization problem, with application in spatial statistics. It asks to find a maximum-determinant order-$s$ principal submatrix of an order-$n$ covariance…

Optimal camera placement plays a crucial role in applications such as surveillance, environmental monitoring, and infrastructure inspection. Even highly abstracted versions of this problem are NP-hard due to the high-dimensional continuous…

Dense image matching is a fundamental low-level problem in Computer Vision, which has received tremendous attention from both discrete and continuous optimization communities. The goal of this paper is to combine the advantages of discrete…

In this paper we study conditions which guarantee the existence of perfect matchings and perfect fractional matchings in uniform hypergraphs. We reduce this problem to an old conjecture by Erd\H{o}s on estimating the maximum number of edges…

We consider a new 3d superconformal index defined as the path integral over $\mathbb{RP}^2 \times \mathbb{S}^1$, and get the generic formula for this index with arbitrary number of U$(1)$ gauge symmetries via the localization technique. We…

We design optimal $2 \times N$ ($2 <N$) matrices, with unit columns, so that the maximum condition number of all the submatrices comprising 3 columns is minimized. The problem has two applications. When estimating a 2-dimensional signal by…

We consider an identification problem, where the state $u$ is governed by a fractional elliptic equation and the unknown variable corresponds to the order $s \in (0,1)$ of the underlying operator. We study the existence of an optimal pair…

Perfect Matching-Cut is the problem of deciding whether a graph has a perfect matching that contains an edge-cut. We show that this problem is NP-complete for planar graphs with maximum degree four, for planar graphs with girth five, for…

We present a novel area matching algorithm for merging two different 2D grid maps. There are many approaches to address this problem, nevertheless, most previous work is built on some assumptions, such as rigid transformation, or similar…

We consider the optimal transport problem over convex costs arising from optimal control of linear time-invariant(LTI) systems when the initial and target measures are assumed to be supported on the set of equilibrium points of the LTI…

In the Matching Cut problem we ask whether a graph $G$ has a matching cut, that is, a matching which is also an edge cut of $G$. We consider the variants Perfect Matching Cut and Disconnected Perfect Matching where we ask whether there…

We propose an exact algorithm for solving the longest simple path problem between two given vertices in undirected weighted graphs. By using graph partitioning and dynamic programming, we obtain an algorithm that is significantly faster…

Although 3D shape matching and interpolation are highly interrelated, they are often studied separately and applied sequentially to relate different 3D shapes, thus resulting in sub-optimal performance. In this work we present a unified…

Spectral estimation can be preformed using the so called THREE-like approach. Such method leads to a convex optimization problem whose solution is characterized through its dual problem. In this paper, we show that the dual problem can be…

An analytic pair of dimension n and center V is a pair (V, M) where M is a complex manifold of (complex) dimension n and V is a closed totally real analytic submanifold of dimension n. To an analytic pair (V, M) we associate the class of…

An integral representation result for strictly positive subharmonic functions of a one-dimensional regular diffusion is established. More precisely, any such function can be written as a linear combination of an increasing and a decreasing…