Pages that link to "Item:Q2944526"
From MaRDI portal
The following pages link to Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms (Q2944526):
Displaying 19 items.
- An improved exact algorithm for TSP in graphs of maximum degree 4 (Q255262) (← links)
- An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure (Q262259) (← links)
- Exact algorithms for dominating set (Q411862) (← links)
- A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between (Q414887) (← links)
- A refined exact algorithm for edge dominating set (Q477194) (← links)
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods (Q494329) (← links)
- An exact algorithm for maximum independent set in degree-5 graphs (Q896662) (← links)
- Parameterized algorithms for \(d\)-hitting set: the weighted case (Q964386) (← links)
- On two techniques of combining branching and treewidth (Q1022343) (← links)
- A refined algorithm for maximum independent set in degree-4 graphs (Q1680494) (← links)
- Exact algorithms for edge domination (Q1945174) (← links)
- Exact algorithms for maximum independent set (Q2013558) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- Inexact graph matching using a hierarchy of matching processes (Q2288126) (← links)
- Computing optimal Steiner trees in polynomial space (Q2392926) (← links)
- Improved exact algorithms for mildly sparse instances of MAX SAT (Q2405896) (← links)
- On the Number of Minimal Separators in Graphs (Q2827806) (← links)
- A Faster Algorithm for Dominating Set Analyzed by the Potential Method (Q2891336) (← links)
- Faster Steiner Tree Computation in Polynomial-Space (Q3541105) (← links)
