Pages that link to "Item:Q5901640"
From MaRDI portal
The following pages link to LATIN 2004: Theoretical Informatics (Q5901640):
Displaying 13 items.
- A note on the \(\epsilon\)-indicator subset selection (Q391190) (← links)
- Consistent subsets: computationally feasible methods to compute the Houtman-Maks-index (Q498874) (← links)
- Approximate selection theorems and their applications (Q1364829) (← links)
- The sublinear operator method and selector problems (Q1377957) (← links)
- Efficient algorithms for approximate smooth selection (Q2050514) (← links)
- New bounds for subset selection from conic relaxations (Q2076815) (← links)
- Constant time approximation scheme for largest well predicted subset (Q2377379) (← links)
- Approximation schemes for a class of subset selection problems (Q2381527) (← links)
- The Methods for Approximation of Principal Points for Binary Distributions on the Basis of Submodularity (Q3462365) (← links)
- Approximating Component Selection with General Costs (Q3628457) (← links)
- (Q3711465) (← links)
- On the Optimality of the Backward Greedy Algorithm for the Subset Selection Problem (Q4943659) (← links)
- On the General Position Subset Selection Problem (Q5408587) (← links)