We also give a 34-approximation for the knapsack median problem, which greatly improves the approximation constant in [13]. Using the same technique, we also give a 9-approximation for matroid median problem introduced in [11], improving on their 16-approximation.MosesCharikar...
we resort toparameterized algorithms[15,18,20]. We say that a problem isfixed-parameter tractable(FPT) with respect to a parameterif it can be solved intime for some computable functionfand instance size. One very natural parameter is thesolution sizek, which is expected to be small in ...
IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, Beijing, China, August 3-9, 2013. Computational Disaster Management. Pascal Van Hentenryck 电商所评分:2 原文链接 谷歌学术 必应学术 百度学术 Soft Robotics: The Next Generation of Intelligent Machines. ...
Using the same technique, we also give a 9-approximation for matroid median problem introduced in [11], improving on their 16-approximation.Moses CharikarShi LiInternational Colloquium on Automata, Languages and Programming;International Workshop on Classical Logic and Computation;Workshop on ...
We also give a 34-approximation for the knapsack median problem, which greatly improves the approximation constant in [13]. Using the same technique, we also give a 9-approximation for matroid median problem introduced in [11], improving on their 16-approximation.MosesCharikar...
We also give a 34-approximation for the knapsack median problem, which greatly improves the approximation constant in [13]. Using the same technique, we also give a 9-approximation for matroid median problem introduced in [11], improving on their 16-approximation.MosesCharikar...
The inverse optimization problem regarding matroid theory, a universal theory of both linear algebra and graph theory, was considered by Cai and Li [12], Zhang et al. [35]. In the class of inverse combinatorial optimization problem, the inverse location problem was intensively investigated with ...
Iwama, S. Miyazaki, The Hospitals/Residents problem with quota lower bounds, in: Proceedings of MATCH-UP 2008: Matching under preferences, satellite workshop of ICALP 2008, 2008, pp. 55–66. Google Scholar [14] B. Klaus, F. Klijn Median stable matching for college admissions International ...