On Problems Equivalent to (min,+)-Convolution
نویسندگان
چکیده
منابع مشابه
On Problems Equivalent to (min, +)-Convolution
In the recent years, significant progress has been made in explaining apparent hardness ofimproving over naive solutions for many fundamental polynomially solvable problems. Thiscame in the form of conditional lower bounds – reductions to one of problems assumed to behard. These include 3SUM, All-Pairs Shortest Paths, SAT and Orthogonal Vectors, and others.In the (min,+)-convolu...
متن کامل( max , min )-convolution and Mathematical Morphology
A formal de nition of morphological operators in (max,min)algebra is introduced and their relevant properties from an algebraic viewpoint are stated. Some previous works in mathematical morphology have already encountered this type of operators but a systematic study of them has not yet been undertaken in the morphological literature. It is shown in particular that one of their fundamental prop...
متن کاملMin-max-min Geometric Facility Location Problems
We propose algorithms for a special type of geometric facility location problem in which customers may choose not to use the facility. We minimize the maximum cost incurred by a customer, where the cost itself is a minimum between two costs, according to whether the facility is used or not. We therefore call this type of location problem a min-max-min geometric facility location problem. As a f...
متن کاملConvolution Complementarity Problems with Application to Impact Problems
Convolution complementarity problems have the form 0 ≤ u(t) ⊥ (k∗u)(t)+q(t) ≥ 0 for all t. These are shown to have solutions provided k(t) satisfies some mild regularity conditions, and provided k(0) is a P-matrix. Uniqueness follows under some further mild regularity conditions. An application to an impact problem is used to illustrate the theory.
متن کاملMin-Max Problems on Factor-Graphs
We study the min-max problem in factor graphs, which seeks the assignment that minimizes the maximum value over all factors. We reduce this problem to both min-sum and sum-product inference, and focus on the later. This approach reduces the min-max inference problem to a sequence of constraint satisfaction problems (CSPs) which allows us to sample from a uniform distribution over the set of sol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2019
ISSN: 1549-6325,1549-6333
DOI: 10.1145/3293465