Pages that link to "Item:Q390124"

The following pages link to Closest pair and the post office problem for stochastic points (Q390124):

Displaying 11 items.

• Computing Shapley values in the plane (Q2118220) (← links)
• The most-likely skyline problem for stochastic points (Q2306361) (← links)
• On the expected diameter, width, and complexity of a stochastic convex hull (Q2331212) (← links)
• On the arrangement of stochastic lines in \(\mathbb{R}^2\) (Q2363351) (← links)
• Convex hulls under uncertainty (Q2408916) (← links)
• Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points (Q3448848) (← links)
• (Q5088947) (← links)
• Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle (Q5089159) (← links)
• r-Gatherings on a star and uncertain r-gatherings on a line (Q5101887) (← links)
• The Most Likely Object to be Seen Through a Window (Q5149565) (← links)
• Maximum box problem on stochastic points (Q5918465) (← links)