The following pages link to Algorithmics for hard problems. (Q1773216):
Displayed 9 items.
- Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems (Q1023397) (← links)
- A randomized algorithm for determining dominating sets in graphs of maximum degree five (Q1034633) (← links)
- A fixed-parameter tractability result for multicommodity demand flow in trees (Q1045910) (← links)
- On simplifying dot maps. (Q1421029) (← links)
- Dynamic Grover search: applications in recommendation systems and optimization problems (Q1679370) (← links)
- Homotopy continuation approaches for robust SV classification and regression (Q1697922) (← links)
- A theoretical study on the behavior of simulated annealing leading to a new cooling schedule (Q1779535) (← links)
- Removing nondeterminism in constant height pushdown automata (Q2252532) (← links)
- The online knapsack problem: advice and randomization (Q2437775) (← links)