Optimal approximation algorithm of feature coefficients and identification of target

1994 ◽  
Vol 11 (1) ◽  
pp. 57-63
Author(s):  
Liao Supeng ◽  
Li Xingguo ◽  
Fang Dagang
Keyword(s):  
Approximation Algorithm ◽  
Optimal Approximation

The minimum zone evaluation for elliptical profile error based on the geometry optimal approximation algorithm

Measurement ◽  
2015 ◽  
Vol 75 ◽  
pp. 284-288 ◽  
Author(s):  
Lei Xianqing ◽  
Gao Zuobin ◽  
Cui Jingwei ◽  
Wang Haiyang ◽  
Wang Shifeng
Keyword(s):  
Approximation Algorithm ◽  
Optimal Approximation ◽  
Profile Error ◽  
Minimum Zone

scholarly journals Near-optimal approximation algorithm for simultaneous Max-Cut

2018 ◽  
pp. 1407-1425
Author(s):  
Amey Bhangale ◽  
Subhash Khot ◽  
Swastik Kopparty ◽  
Sushant Sachdeva ◽  
Devanathan Thiruvenkatachari
Keyword(s):  
Approximation Algorithm ◽  
Optimal Approximation

scholarly journals An almost optimal approximation algorithm for monotone submodular multiple knapsack

2021 ◽  
Author(s):  
Yaron Fairstein ◽  
Ariel Kulik ◽  
Joseph (Seffi) Naor ◽  
Danny Raz ◽  
Hadas Shachnai
Keyword(s):  
Approximation Algorithm ◽  
Optimal Approximation ◽  
Multiple Knapsack

An optimal approximation algorithm for the rectilinearm-center problem

Algorithmica ◽  
1990 ◽  
Vol 5 (1-4) ◽  
pp. 341-352 ◽  
Author(s):  
M. T. Ko ◽  
R. C. T. Lee ◽  
J. S. Chang
Keyword(s):  
Approximation Algorithm ◽  
Optimal Approximation ◽  
Center Problem

scholarly journals Guaranteeing Maximin Shares: Some Agents Left Behind

2021 ◽  
Author(s):  
Hadi Hosseini ◽  
Andrew Searns
Keyword(s):  
Approximation Algorithm ◽  
Polynomial Time ◽  
Synthetic Data ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Optimal Approximation ◽  
Constant Number ◽  
Indivisible Goods ◽  
Approximation Techniques ◽  
Left Behind

The maximin share (MMS) guarantee is a desirable fairness notion for allocating indivisible goods. While MMS allocations do not always exist, several approximation techniques have been developed to ensure that all agents receive a fraction of their maximin share. We focus on an alternative approximation notion, based on the population of agents, that seeks to guarantee MMS for a fraction of agents. We show that no optimal approximation algorithm can satisfy more than a constant number of agents, and discuss the existence and computation of MMS for all but one agent and its relation to approximate MMS guarantees. We then prove the existence of allocations that guarantee MMS for 2/3 of agents, and devise a polynomial time algorithm that achieves this bound for up to nine agents. A key implication of our result is the existence of allocations that guarantee the value that an agent receives by partitioning the goods into 3n/2 bundles, improving the best known guarantee when goods are partitioned into 2n-2 bundles. Finally, we provide empirical experiments using synthetic data.

Sign in / Sign up

Export Citation Format

Share Document