Fractional Packing and Parametric Search Frameworks

2016 ◽  
pp. 19-37
Author(s):  
Michael Holzhauser
Keyword(s):  
Parametric Search

scholarly journals Computing the Yolk in Spatial Voting Games without Computing Median Lines

2019 ◽  
Vol 33 ◽  
pp. 2012-2019
Author(s):  
Joachim Gudmundsson ◽  
Sampson Wong
Keyword(s):  
Upper Bound ◽  
Linear Time ◽  
Search Technique ◽  
Important Concept ◽  
Uncovered Set ◽  
Spatial Voting ◽  
Voting Games ◽  
Parametric Search ◽  
Linear Time Algorithms

The yolk is an important concept in spatial voting games: the yolk center generalises the equilibrium and the yolk radius bounds the uncovered set. We present near-linear time algorithms for computing the yolk in the plane. To the best of our knowledge our algorithm is the first that does not precompute median lines, and hence is able to break the best known upper bound of O(n4/3) on the number of limiting median lines. We avoid this requirement by carefully applying Megiddo’s parametric search technique, which is a powerful framework that could lead to faster algorithms for other spatial voting problems.

scholarly journals Parametric search made practical

2004 ◽  
Vol 28 (2-3) ◽  
pp. 75-88 ◽  
Author(s):  
René van Oostrum ◽  
Remco C. Veltkamp
Keyword(s):  
Parametric Search

scholarly journals Ray Shooting and Parametric Search

1993 ◽  
Vol 22 (4) ◽  
pp. 794-806 ◽  
Author(s):  
Pankaj K. Agarwal ◽  
Jiří Matoušek
Keyword(s):  
Ray Shooting ◽  
Parametric Search
Sign in / Sign up

Export Citation Format

Share Document