scholarly journals Positivity of cumulative sums for multi-index function components explains the lower bound formula in the Levin-Robbins-Leu family of sequential subset selection procedures

2020 ◽  
Vol 39 (4) ◽  
pp. 520-542
Author(s):  
Bruce Levin ◽  
Cheng-Shiun Leu
Keyword(s):  
Lower Bound ◽  
Subset Selection ◽  
Selection Procedures ◽  
Multi Index ◽  
Index Function ◽  
Cumulative Sums

scholarly journals Finding Points in General Position

2017 ◽  
Vol 27 (04) ◽  
pp. 277-296 ◽  
Author(s):  
Vincent Froese ◽  
Iyad Kanj ◽  
André Nichterlein ◽  
Rolf Niedermeier
Keyword(s):  
Lower Bound ◽  
General Position ◽  
Subset Selection ◽  
Selection Problem ◽  
Fixed Parameter Tractability ◽  
Maximum Cardinality ◽  
Exponential Time ◽  
Running Time ◽  
Fixed Parameter ◽  
Set Of Points

We study the General Position Subset Selection problem: Given a set of points in the plane, find a maximum-cardinality subset of points in general position. We prove that General Position Subset Selection is NP-hard, APX-hard, and present several fixed-parameter tractability results for the problem as well as a subexponential running time lower bound based on the Exponential Time Hypothesis.

Subset selection procedures

2009 ◽  
Vol 3 (4) ◽  
pp. 202-210 ◽  
Author(s):  
E J Chen
Keyword(s):  
Subset Selection ◽  
Selection Procedures

TWO NEW CLASSES OF SUBSET SELECTION PROCEDURES FOR LOCATION PARAMETERS

2002 ◽  
Vol 20 (1-4) ◽  
Author(s):  
Narinder Kumar ◽  
Gobind P. Mehta ◽  
Virender Kumar
Keyword(s):  
Subset Selection ◽  
Selection Procedures ◽  
Location Parameters

scholarly journals A Note on Optimal Subset Selection Procedures

1980 ◽  
Vol 8 (5) ◽  
pp. 1164-1167 ◽  
Author(s):  
Shanti S. Gupta ◽  
Deng-Yuan Huang
Keyword(s):  
Subset Selection ◽  
Selection Procedures ◽  
Optimal Subset
Sign in / Sign up

Export Citation Format

Share Document