富尔克森奖(英语:Fulkerson Prize)是国际数学优化学会和美国数学学会联合设立的奖项,专门奖励离散数学领域的杰出论文。在国际数学优化学会每三年召开一次的大会上奖励至多三篇论文,奖金各1500美元。最初奖金来自于一个纪念基金。此纪念基金是由数学家戴尔伯特·雷·富尔克森的朋友们建立的、美国数学学会管理,用于激励富尔克森自己研究领域的杰出数学成果。目前奖金来自于国际数学优化学会管理的一笔捐赠资产。
Quick Facts 富尔克森奖, 授予对象 ...
Close
[1]
- 1979年:
- 1982:
- 1985:
- 1988:
- 1991:
- Martin E. Dyer, Alan M. Frieze 和 Ravindran Kannan - 基于随机漫步的计算凸体体积的近似算法。[17]
- Alfred Lehman - 关于逻辑矩阵的完美图理论。[18]
- Nikolai E. Mnev - Mnev通用定理:每个半代数集都等价于一个定向拟阵的所有实现构成的空间。[19]
- 1994:
- Louis Billera - 求出空间三角剖分上的分段多项式函数空间的基。[20]
- Gil Kalai - 在Hirsch猜想上的进展。[21]
- Neil Robertson, Paul Seymour和罗宾·托马斯 - 哈德维格猜想的6色情形。[22]
- 1997:
- 2000:
- Michel X. Goemans和David P. Williamson - 基于半正定规划的近似算法。[24]
- Michele Conforti, Gérard Cornuéjols和Mendu Rammohan Rao - 在多项式时间内识别平衡逻辑矩阵的算法。[25][26]
- 2003:
- Jim Geelen, A. M. H. Gerards 和 A. Kapoor - 关于拟阵子式的Rota猜想在GF(4)的情形。[27][28]
- Bertrand Guenin - 弱二部图的一个禁止子图刻画。[29][28]
- Satoru Iwata, Lisa Fleischer, Satoru Fujishige和Alexander Schrijver - 证明次模函数最小化问题是强多项式时间的。[30][31][28]
- 2006:
- 2009:
- 2012:
- Sanjeev Arora, Satish Rao 和 乌梅什·瓦兹拉尼 - 把图的顶点割和相关问题的近似比例从改进到。[42]
- Anders Johansson, Jeff Kahn 和 Van H. Vu - 确定了随机图具有下述性质的边密度的阈值:能被同构于一个给定的更小图的图的不交并覆盖。[43]
- 洛瓦兹·拉兹洛和Balázs Szegedy - 刻画稠密图序列的子图的重数。[44]
- 2015 :
- Francisco Santos Leal - 举出Hirsch猜想的一个反例。[45][46]
- 2018 :
- Robert Morris, 小早川美晴, Simon Griffiths, Peter Allen 和 Julia Böttcher - The chromatic thresholds of graphs
- Thomas Rothvoss - The Matching Polytope has Exponential Extension Complexity
Judin, D.B.; Nemirovski, Arkadi. Informational complexity and effective methods of solution for convex extremal problems. Ekonomika i Matematicheskie Metody. 1976, 12: 357–369.
Khachiyan, Leonid. A polynomial algorithm in linear programming. Akademiia Nauk SSSR. Doklady. 1979, 244: 1093–1096.
Grötschel, Martin; Lovász, László; Schrijver, Alexander. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica. 1981, 1: 169–197. doi:10.1007/bf02579273.
Egorychev, G. P. The solution of van der Waerden's problem for permanents. Akademiia Nauk SSSR. Doklady. 1981, 258: 1041–1044.
Falikman, D. I. A proof of the van der Waerden conjecture on the permanent of a doubly stochastic matrix. Matematicheskie Zametki. 1981, 29: 931–938.
Beck, Jozsef. Roth's estimate of the discrepancy of integer sequences is nearly sharp. Combinatorica. 1981, 1 (4): 319–325. doi:10.1007/bf02579452.
Luks, Eugene M. Isomorphism of graphs of bounded valence can be tested in polynomial time. Journal of Computer and System Sciences. 1982, 25 (1): 42–65. doi:10.1016/0022-0000(82)90009-5.
Tardos, Éva. A strongly polynomial minimum cost circulation algorithm. Combinatorica. 1985, 5: 247–256. doi:10.1007/bf02579369.
Karmarkar, Narendra. A new polynomial-time algorithm for linear programming. Combinatorica. 1984, 4: 373–395. doi:10.1007/bf02579150.
Alfred Lehman, "The width-length inequality and degenerate projective planes," W. Cook and P. D. Seymour (eds.), Polyhedral Combinatorics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 1, (American Mathematical Society, 1990) pp. 101-105.
Nikolai E. Mnev, "The universality theorems on the classification problem of configuration varieties and convex polytope varieties," O. Ya. Viro (ed.), Topology and Geometry-Rohlin Seminar, Lecture Notes in Mathematics 1346 (Springer-Verlag, Berlin, 1988) pp. 527-544.
Billera, Louis. Homology of smooth splines: Generic triangulations and a conjecture of Strang. Transactions of the American Mathematical Society. 1988, 310: 325–340. doi:10.2307/2001125.
Kalai, Gil. Upper bounds for the diameter and height of graphs of the convex polyhedra. Discrete and Computational Geometry. 1992, 8: 363–372. doi:10.1007/bf02293053.
Goemans, Michel X.; Williamson, David P. Improved approximation algorithms for the maximum cut and satisfiability probelsm using semi-definite programming. Journal of the ACM. 1995, 42 (6): 1115–1145. doi:10.1145/227683.227684.
Michele Conforti, Gérard Cornuéjols, and M. R. Rao, "Decomposition of balanced matrices", Journal of Combinatorial Theory, Series B, 77 (2): 292–406, 1999.
J. F. Geelen, A. M. H. Gerards and A. Kapoor, "The Excluded Minors for GF(4)-Representable Matroids," Journal of Combinatorial Theory, Series B, 79 (2): 247–2999, 2000.
Bertrand Guenin, "A characterization of weakly bipartite graphs," Journal of Combinatorial Theory, Series B, 83 (1): 112–168, 2001.
Satoru Iwata, Lisa Fleischer, Satoru Fujishige, "A combinatorial strongly polynomial algorithm for minimizing submodular functions," Journal of the ACM, 48 (4): 761–777, 2001.
Alexander Schrijver, "A combinatorial algorithm minimizing submodular functions in strongly polynomial time," Journal of Combinatorial Theory, Series B 80 (2): 346–355, 2000.
Manindra Agrawal, Neeraj Kayal and Nitin Saxena, "PRIMES is in P," Annals of Mathematics, 160 (2): 781–793, 2004.
Mark Jerrum, Alistair Sinclair and Eric Vigoda, "A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries," Journal of the ACM, 51 (4): 671–697, 2004.
Neil Robertson and Paul Seymour, "Graph Minors. XX. Wagner's conjecture," Journal of Combinatorial Theory, Series B, 92 (2): 325–357, 2004.
Ferguson, Samuel P. Sphere Packings, V. Pentahedral Prisms. Discrete and Computational Geometry. 2006, 36: 167–204. doi:10.1007/s00454-005-1214-y.
Johansson, Anders; Kahn, Jeff; Vu, Van H. Factors in random graphs. Random Structures and Algorithms. 2008, 33: 1–28. doi:10.1002/rsa.20224.