Computing optimal Morse matchings

被引：48
|
作者：
Joswig, M
Pfetsch, ME
机构：
[1] Tech Univ Darmstadt, Fachbereich Math, D-64289 Darmstadt, Germany
[2] Zuse Inst Berlin, D-14195 Berlin, Germany
来源：
SIAM JOURNAL ON DISCRETE MATHEMATICS | 2006年 / 20卷 / 01期
关键词：
discrete Morse function; Morse matching;
D O I：
10.1137/S0895480104445885
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Morse matchings capture the essential structural information of discrete Morse functions. We show that computing optimal Morse matchings is NP-hard and give an integer programming formulation for the problem. Then we present polyhedral results for the corresponding polytope and report on computational results.
引用
收藏
页码：11 / 25
页数：15
相关论文
共 50 条
  • [21] Pareto optimal matchings with lower quotas
    Cechlarova, Katarina
    Fleiner, Tamas
    MATHEMATICAL SOCIAL SCIENCES, 2017, 88 : 3 - 10
  • [22] Chip Removal for Computing the Number of Perfect Matchings
    Bursian O.V.
    Journal of Mathematical Sciences, 2016, 216 (1) : 41 - 52
  • [23] Online Elicitation of Necessarily Optimal Matchings
    Peters, Jannik
    THIRTY-SIXTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FOURTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE / THE TWELVETH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2022, : 5164 - 5172
  • [24] Necessarily Optimal One-Sided Matchings
    Hosseini, Hadi
    Menon, Vijay
    Shah, Nisarg
    Sikdar, Sujoy
    THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 5481 - 5488
  • [25] Computing the Number of k-Matchings in Benzenoid Chains
    Oz, Mert Sinan
    Cangul, Ismail Naci
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2022, 88 (01) : 79 - 92
  • [26] Computing the Number of s-Matchings in Cyclooctatetraene Chains
    Chen, Shiqin
    Han, Hui
    Geng, Xianya
    SYMMETRY-BASEL, 2024, 16 (08):
  • [27] OPTIMAL MATCHINGS + DEGREE-CONSTRAINED SUBGRAPHS
    GOLDMAN, AJ
    JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1964, B 68 (01): : 27 - +
  • [28] A COMPLEX IN MORSE THEORY COMPUTING INTERSECTION HOMOLOGY
    Ludwig, Ursula
    ANNALES DE L INSTITUT FOURIER, 2017, 67 (01) : 197 - 236
  • [29] LP based approach to optimal stable matchings
    Teo, CP
    Sethuraman, J
    PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1997, : 710 - 719
  • [30] Towards an Optimal Contention Resolution Scheme for Matchings
    Nuti, Pranav
    Vondrak, Jan
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2023, 2023, 13904 : 378 - 392
12345