scientific article; zbMATH DE number 7559220
From MaRDI portal
Publication:5088947
DOI10.4230/LIPIcs.SoCG.2019.20MaRDI QIDQ5088947
Sergio Cabello, Timothy M. Chan
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1804.03894
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
arrangementsconvex hullconvolutionsairport problemShapley valuesbounding boxminimum enclosing diskstochastic computational geometry
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Closest pair and the post office problem for stochastic points
- Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
- On approximately fair cost allocation in Euclidean TSP games
- On the complexity of halfspace area queries
- On the separability of stochastic geometric objects, with applications
- Range-max queries on uncertain data
- A cooperative location game based on the 1-center location problem
- Convex hulls under uncertainty
- Computational Aspects of Cooperative Game Theory
- Hyperplane separability and convexity of probabilistic point sets
- Batched Point Location in SINR Diagrams via Algebraic Tools
- Algorithmic Cooperative Game Theory
- On Computing the Centroid of the Vertices of an Arrangement and Related Problems
- New Data Structures for Orthogonal Range Queries
- New Upper Bounds in Klee’s Measure Problem
- A Simple Expression for the Shapley Value in a Special Case
- Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
- On the Complexity of Cooperative Solution Concepts
- Computing the Distance between Piecewise-Linear Bivariate Functions
- Stochastic minimum spanning trees in euclidean spaces
- Algorithmic Game Theory
This page was built for publication:
