Pages that link to "Item:Q2473037"
From MaRDI portal
The following pages link to Open problems around exact algorithms (Q2473037):
Displaying 20 items.
- Solving the job-shop scheduling problem optimally by dynamic programming (Q339631) (← links)
- Exact algorithms for dominating set (Q411862) (← links)
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789) (← links)
- Sex-equal stable matchings: complexity and exact algorithms (Q528851) (← links)
- Scheduling partially ordered jobs faster than \(2^n\) (Q528859) (← links)
- Improved upper bounds for vertex cover (Q708228) (← links)
- A note on the intersection property for flat boxes and boxicity in \(\mathbb R^d\) (Q722353) (← links)
- On comparing algorithms for the maximum clique problem (Q1671301) (← links)
- Exact algorithms for finding longest cycles in claw-free graphs (Q1939671) (← links)
- Exact algorithms for counting 3-colorings of graphs (Q2081467) (← links)
- Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940) (← links)
- Complement, Complexity, and Symmetric Representation (Q2949722) (← links)
- Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory (Q3452571) (← links)
- If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser (Q4562283) (← links)
- Improved bounds for minimal feedback vertex sets in tournaments (Q4581278) (← links)
- Feedback Vertex Sets in Tournaments (Q4908824) (← links)
- (Q5075820) (← links)
- Faster graph coloring in polynomial space (Q5925619) (← links)
- Solving larger maximum clique problems using parallel quantum annealing (Q6098277) (← links)
- An ETH-Tight Exact Algorithm for Euclidean TSP (Q6156029) (← links)