无孔
发表于 2025-3-28 16:29:34
On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games,,,archy, the ratio of the cost of the best Nash or correlated equilibrium over the social optimum. We show that for the sum social cost, which corresponds to the average cost of the players, every linear congestion game has Nash and correlated price of stability at most 1.6. We also give an almost mat
清唱剧
发表于 2025-3-28 21:07:23
http://reply.papertrans.cn/16/1533/153289/153289_42.png
cyanosis
发表于 2025-3-29 01:19:03
http://reply.papertrans.cn/16/1533/153289/153289_43.png
他一致
发表于 2025-3-29 04:15:54
An Algorithm for the SAT Problem for Formulae of Linear Length,. .) with .< 2 for every fixed .). For . ≤ 4, the results coincide with an earlier paper where we achieved running times of .(2.) for . = 3 and .(2.) for . = 4 (for . ≤ 2, the problem is solvable in polynomial time). For .>4, these results are the best yet, with running times of .(2.) for . = 5 and
critique
发表于 2025-3-29 10:05:43
Linear-Time Enumeration of Isolated Cliques, that this parameter . is an interesting measure which governs the complexity of finding cliques. In particular, if . is a constant, then we can enumerate all .-isolated maximal cliques in linear time, and if . = .(log .), then we can enumerate all .-isolated maximal cliques in polynomial time. Note
GROG
发表于 2025-3-29 14:24:47
Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs,omplexity is .(. . . .log . + . . . .), where . is the number of vertices in the graph and . is the genus of the surface. If . = .(. .), this represents a considerable improvement over previous results by Thomassen, and Erickson and Har-Peled. We also give algorithms to find a shortest non-contracti
legislate
发表于 2025-3-29 18:36:47
Delineating Boundaries for Imprecise Regions,” We provide two classes of algorithms for the problem of computing reasonable boundaries of such regions, based on evidence of given data points that are deemed likely to lie either inside or outside the region. Our problem formulation leads to a number of problems related to red-blue point separat
臭名昭著
发表于 2025-3-29 22:41:47
http://reply.papertrans.cn/16/1533/153289/153289_48.png
Evacuate
发表于 2025-3-30 01:29:47
Min Sum Clustering with Penalties, a few distant objects, called ., may exert a disproportionately strong influence over the solution. In this work we investigate the . . clustering problem while addressing outliers in a meaningful way..Given a complete graph . = (.,.), a weight function . : . →. . on its edges, and . a penalty func
Pruritus
发表于 2025-3-30 06:25:12
Unbalanced Graph Cuts,ource side, subject to the constraint that its capacity not exceed a prescribed bound .. Besides being of interest in the study of graph cuts, this problem arises in many practical settings, such as in epidemiology, disaster control, military containment, as well as finding dense subgraphs and commu