neologism 发表于 2025-3-30 11:58:45

http://reply.papertrans.cn/83/8279/827838/827838_51.png

织物 发表于 2025-3-30 13:00:01

http://reply.papertrans.cn/83/8279/827838/827838_52.png

MIR 发表于 2025-3-30 19:05:50

978-3-642-09547-4Springer-Verlag Berlin Heidelberg 2009

Confess 发表于 2025-3-30 21:05:58

http://reply.papertrans.cn/83/8279/827838/827838_54.png

残暴 发表于 2025-3-31 04:15:13

https://doi.org/10.1007/978-3-540-76796-1Partition; algorithms; calculus; combinatorial optimization; combinatorics; complexity; discrete mathemati

epicondylitis 发表于 2025-3-31 07:58:56

,Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems,mples include problems in VLSI-design or problems in bioinformatics. For such problems the question arises: What is the best solution that can be obtained in linear time? We survey linear time approximation algorithms for some classical problems from combinatorial optimization, e.g. matchings and branchings.

Adrenaline 发表于 2025-3-31 09:13:45

http://reply.papertrans.cn/83/8279/827838/827838_57.png

咆哮 发表于 2025-3-31 14:06:05

http://reply.papertrans.cn/83/8279/827838/827838_58.png

FOLLY 发表于 2025-3-31 20:11:41

http://reply.papertrans.cn/83/8279/827838/827838_59.png

四目在模仿 发表于 2025-4-1 00:08:55

Euler Complexes,We present a class of instances of the existence of a second object of a specified type, in fact, of an even number of objects of a specified type, which generalizes the existence of an equilibrium for bimatrix games. The proof is an abstract generalization of the Lemke–Howson algorithm for finding an equilibrium of a bimatrix game.
页: 1 2 3 4 5 [6] 7
查看完整版本: Titlebook: Research Trends in Combinatorial Optimization; Bonn 2008 William Cook,László Lovász,Jens Vygen Book 2009 Springer-Verlag Berlin Heidelberg