Legend
发表于 2025-4-1 04:22:39
An Approximation Algorithm for Hypergraph Max ,-Cut with Given Sizes of Partsd . positive integers ..,..., .. such that .. It is required to partition the vertex set . into . parts ..,..., X., with each part .. having size .., so as to maximize the total weight of edges not lying entirely in any part of the partition. The version of the problem in which |.. may be arbitrary
stratum-corneum
发表于 2025-4-1 07:54:13
http://reply.papertrans.cn/16/1531/153049/153049_62.png
deceive
发表于 2025-4-1 11:03:19
Computing Largest Common Point Sets under Approximate Congruenceive study. Although polynomial time solutions are known for the planar case and for restricted sets of transformations and metrics (like translations and the Hausdorff-metric under L.-norm), no complexity results are formally known for the general problem. In this paper we give polynomial time algor
小步舞
发表于 2025-4-1 17:56:13
http://reply.papertrans.cn/16/1531/153049/153049_64.png
Commodious
发表于 2025-4-1 20:33:11
http://reply.papertrans.cn/16/1531/153049/153049_65.png
ASTER
发表于 2025-4-1 23:44:44
Fast Algorithms for Even/Odd Minimum Cuts and Generalizationsoemans and Ramakrishnan by a factor of . (here . is the size of the ground vertex set). Our improvements apply among others to the minimum directed T-odd or T-even cut and to the directed minimum Steiner cut problems. The (slightly more general) result of Goemans and Ramakrishnan shows that a collec