Countermand
发表于 2025-3-27 00:33:44
http://reply.papertrans.cn/47/4683/468251/468251_31.png
bronchodilator
发表于 2025-3-27 04:24:52
A Min-Max Theorem on Feedback Vertex Sets (Preliminary Version), cycle-vertex incidence matrix and . is the all-one vector. The consequence is a min-max relation on packing and covering cycles, together with strongly polynomial time algorithms for the feedback vertex set problem and the cycle packing problem on the corresponding bipartite tournaments. In additio
forestry
发表于 2025-3-27 07:55:58
On the Separation of Maximally Violated mod-, Cuts,ted to the definition of effective separation procedures for families of well-structured cuts. In this paper we address the separation of Chvátal rank-1 inequalities in the context of general ILP’s of the form min{. . . ≤ . integer}, where . is an . integer matrix and . an .-dimensional integer vect
Dappled
发表于 2025-3-27 12:31:28
Improved Approximation Algorithms for Capacitated Facility Location Problems,n problem (CFLP) in which the service costs obey the triangle inequality produces a solution in polynomial time which is within a factor of 8 + ε of the value of an optimal solution. By simplifying their analysis, we are able to show that the same heuristic produces a solution which is within a fact
极肥胖
发表于 2025-3-27 16:42:18
Optimal 3-Terminal Cuts and Linear Programming,mponent of .. If a non-negative edge weight . . is specified for each ., the . is to find a 3-cut of minimum total weight. This problem is NP-hard, and in fact, is max-SNP-hard. An approximation algorithm having performance guarantee 7/6 has recently been given by Călinescu, Karloff, and Rabani. It
AVANT
发表于 2025-3-27 20:55:27
http://reply.papertrans.cn/47/4683/468251/468251_36.png
夹死提手势
发表于 2025-3-27 22:26:11
http://reply.papertrans.cn/47/4683/468251/468251_37.png
泥土谦卑
发表于 2025-3-28 02:13:53
Universally Maximum Flow with Piecewise-Constant Capacities,sible, where capacities are interpreted as an upper bound on the rate of flow entering an arc. A related problem is the ., which is to send a flow from source to sink that maximizes the amount of flow arriving at the sink by time . simultaneously for all . ≤ .. We consider a further generalization o
filicide
发表于 2025-3-28 09:57:36
http://reply.papertrans.cn/47/4683/468251/468251_39.png
FRET
发表于 2025-3-28 12:55:32
http://reply.papertrans.cn/47/4683/468251/468251_40.png