Mong-Jen Kao

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
On the integrality gap of MFN relaxation for the capacitated facility location problem	2024-05-14	Paper
Approximation algorithm for vertex cover with multiple covering constraints	2022-07-21	Paper
Approximation algorithm for vertex cover with multiple covering constraints Algorithmica	2022-02-01	Paper
Iterative partial rounding for vertex cover with hard capacities Algorithmica	2021-02-01	Paper
Tight approximation for partial vertex cover with hard capacities	2020-11-25	Paper
Tight approximation for partial vertex cover with hard capacities Theoretical Computer Science	2019-06-06	Paper
\(O(f)\) bi-criteria approximation for capacitated covering with hard capacities Algorithmica	2019-05-07	Paper
Iterative partial rounding for vertex cover with hard capacities Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms	2018-07-16	Paper
\(O(f)\) bi-approximation for capacitated covering with hard capacities (available as arXiv preprint)	2018-04-19	Paper
Online dynamic power management with hard real-time guarantees (available as arXiv preprint)	2017-03-03	Paper
Optimal time-convex hull for a straight-line highway in \(L_p\)-metrics Computational Geometry	2016-04-12	Paper
Online dynamic power management with hard real-time guarantees Theoretical Computer Science	2015-07-24	Paper
Capacitated domination: problem complexity and approximation algorithms Algorithmica	2015-05-21	Paper
The density maximization problem in graphs Journal of Combinatorial Optimization	2013-12-09	Paper
Optimal time-convex hull under the \(L _{p }\) metrics Lecture Notes in Computer Science	2013-08-12	Paper
Competitive design and analysis for machine-minimizing job scheduling problem Algorithms and Computation	2013-03-21	Paper
Capacitated domination: constant factor approximations for planar graphs Algorithms and Computation	2011-12-16	Paper
The density maximization problem in graphs Lecture Notes in Computer Science	2011-08-17	Paper
Capacitated domination problem Algorithmica	2011-05-10	Paper
Approximation algorithms for the capacitated domination problem Frontiers in Algorithmics	2010-09-07	Paper
Capacitated Domination Problem Algorithms and Computation	2008-05-27	Paper

Research outcomes over time

This page was built for person: Mong-Jen Kao