Pages that link to "Item:Q2482726"
From MaRDI portal
The following pages link to Incremental medians via online bidding (Q2482726):
Displaying 17 items.
- Optimal search for parameters in Monte Carlo simulation for derivative pricing (Q321025) (← links)
- The inverse 1-median problem on tree networks with variable real edge lengths (Q460433) (← links)
- Incremental facility location problem and its competitive algorithms (Q604759) (← links)
- Online multiple-strip packing (Q621841) (← links)
- Randomized algorithms for online bounded bidding (Q763539) (← links)
- An incremental version of the \(k\)-center problem on boundary of a convex polygon (Q887897) (← links)
- A 16-competitive algorithm for hierarchical median problem (Q893690) (← links)
- Online minimization knapsack problem (Q897874) (← links)
- Optimal online-list batch scheduling (Q990939) (← links)
- Improved bounds for randomized preemptive online matching (Q1706142) (← links)
- An approximation algorithm for the Euclidean incremental median problem (Q1751197) (← links)
- New results on multi-level aggregation (Q1998855) (← links)
- General bounds for incremental maximization (Q2118105) (← links)
- Online clique clustering (Q2300728) (← links)
- Clairvoyant Mechanisms for Online Auctions (Q2817844) (← links)
- Competitive Strategies for Online Clique Clustering (Q2947013) (← links)
- (Q5136319) (← links)
