暂无分享,去创建一个
Eli Fox-Epstein | Roie Levin | David Meierfrankenfeld | Roie Levin | Eli Fox-Epstein | David Meierfrankenfeld
[1] F. Barahona. On the computational complexity of Ising spin glass models , 1982 .
[2] Yuval Rabani,et al. Approximation algorithms for the 0-extension problem , 2001, SODA '01.
[3] Erik D. Demaine,et al. Bidimensionality: new connections between FPT algorithms and PTASs , 2005, SODA '05.
[4] Daniel Cremers,et al. Efficient planar graph cuts with applications in Computer Vision , 2009, CVPR.
[5] David P. Dailey. Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete , 1980, Discret. Math..
[6] Philip N. Klein,et al. A linear-time approximation scheme for planar weighted TSP , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[7] J. Laurie Snell,et al. Markov Random Fields and Their Applications , 1980 .
[8] Hisao Tamaki. A Linear Time Heuristic for the Branch-Decomposition of Planar Graphs , 2003, ESA.
[9] Olga Veksler,et al. Markov random fields with efficient approximations , 1998, Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231).
[10] Brenda S. Baker,et al. Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[11] Kyomin Jung,et al. Local approximate inference algorithms , 2006, ArXiv.
[12] Éva Tardos,et al. Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[13] Mihalis Yannakakis,et al. The complexity of multiway cuts (extended abstract) , 1992, STOC '92.
[14] Yi-Kai Wang,et al. Beyond Baker's Technique , 2014, ArXiv.
[15] Satish Rao,et al. An improved approximation algorithm for the 0-extension problem , 2003, SODA '03.
[16] Sebastian Nowozin,et al. A Comparative Study of Modern Inference Techniques for Structured Discrete Energy Minimization Problems , 2014, International Journal of Computer Vision.
[17] Philip N. Klein,et al. Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs , 2023, STACS.
[18] Charless C. Fowlkes,et al. Planarity matters: map inference in planar markov random fields with applications to computer vision , 2012 .
[19] Niklaus Wirth,et al. Algorithms and Data Structures , 1989, Lecture Notes in Computer Science.
[20] Alexander V. Karzanov,et al. Minimum 0-Extensions of Graph Metrics , 1998, Eur. J. Comb..
[21] Luca Trevisan,et al. Gadgets, approximation, and linear programming , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[22] Philip N. Klein,et al. A polynomial-time approximation scheme for planar multiway cut , 2012, SODA.
[23] Vladimir Kolmogorov,et al. An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision , 2004, IEEE Trans. Pattern Anal. Mach. Intell..
[24] Philip N. Klein,et al. Steiner Tree in Planar Graphs: An O ( n log n ) Approximation Scheme with Singly-Exponential Dependence on Epsilon , 2007, WADS.
[25] Richard Szeliski,et al. A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms , 2001, International Journal of Computer Vision.
[26] H KappesJörg,et al. A Comparative Study of Modern Inference Techniques for Structured Discrete Energy Minimization Problems , 2015 .