Convex and linear models of NP-problems
Sergey Gubin
TL;DR
This paper explores the reduction of NP-problems to convex and linear models using the Birkhoff polytope, aiming to provide new insights into their structural properties.
Contribution
It introduces a novel approach of analyzing NP-problems through convex and linear models on the Birkhoff polytope, offering a fresh perspective.
Findings
NP-problems can be represented within the Birkhoff polytope framework
Convex and linear models provide new tools for understanding NP-problems
Potential for improved algorithms based on convex/linear analysis
Abstract
Reducing the NP-problems to the convex/linear analysis on the Birkhoff polytope.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Complexity and Algorithms in Graphs · Vehicle Routing Optimization Methods