Pages that link to "Item:Q2636503"
From MaRDI portal
The following pages link to Dealing with several parameterized problems by random methods (Q2636503):
Displaying 9 items.
- Randomized Verblunsky parameters in Steklov's problem (Q1791525) (← links)
- An improved kernel for max-bisection above tight lower bound (Q1985605) (← links)
- On the complexity of algorithms for detecting \(k\)-length negative cost cycles (Q2051903) (← links)
- An approximation algorithm for the \(l\)-pseudoforest deletion problem (Q2285146) (← links)
- Solving and sampling with many solutions (Q2309479) (← links)
- An improved linear kernel for complementary maximal strip recovery: simpler and smaller (Q2319903) (← links)
- Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems (Q2354298) (← links)
- Improved PTAS for the constrained \(k\)-means problem (Q2424715) (← links)
- A random arrival rule for division problems with multiple references (Q4571758) (← links)