标题
Inapproximability of shortest paths on perfect matching polytopes
作者
关键词
-
出版物
MATHEMATICAL PROGRAMMING
Volume -, Issue -, Pages -
出版商
Springer Science and Business Media LLC
发表日期
2023-10-21
DOI
10.1007/s10107-023-02025-4
参考文献
相关参考文献
注意:仅列出部分参考文献,下载原文获取全部文献信息。- Shortest Reconfiguration of Perfect Matchings via Alternating Cycles
- (2022) Takehiro Ito et al. SIAM JOURNAL ON DISCRETE MATHEMATICS
- An exponential lower bound for Zadeh’s pivot rule
- (2022) Yann Disser et al. MATHEMATICAL PROGRAMMING
- Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization
- (2022) Jesús A. De Loera et al. SIAM JOURNAL ON OPTIMIZATION
- A note on the approximability of deepest-descent circuit steps
- (2021) Steffen Borgwardt et al. OPERATIONS RESEARCH LETTERS
- Flip Distances Between Graph Orientations
- (2020) Oswin Aichholzer et al. ALGORITHMICA
- On the Circuit Diameter of Some Combinatorial Polytopes
- (2019) Sean Kafer et al. SIAM JOURNAL ON DISCRETE MATHEMATICS
- A polyhedral model for enumeration and optimization over the set of circuits
- (2019) Steffen Borgwardt et al. DISCRETE APPLIED MATHEMATICS
- The Simplex Algorithm Is NP-Mighty
- (2018) Yann Disser et al. ACM Transactions on Algorithms
- An exponential lower bound for Cunningham’s rule
- (2016) David Avis et al. MATHEMATICAL PROGRAMMING
- On the Circuit Diameter of Dual Transportation Polyhedra
- (2015) Steffen Borgwardt et al. SIAM JOURNAL ON DISCRETE MATHEMATICS
- On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond
- (2015) Jesús A. De Loera et al. SIAM JOURNAL ON OPTIMIZATION
- A counterexample to the Hirsch Conjecture
- (2012) Francisco Santos ANNALS OF MATHEMATICS
- Complexity of independent set reconfigurability problems
- (2012) Marcin Kamiński et al. THEORETICAL COMPUTER SCIENCE
- On the complexity of reconfiguration problems
- (2010) Takehiro Ito et al. THEORETICAL COMPUTER SCIENCE
- Finding a long directed cycle
- (2008) Harold N. Gabow et al. ACM Transactions on Algorithms
Publish scientific posters with Peeref
Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.
Learn MoreCreate your own webinar
Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.
Create Now