default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMong-Jen Kao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c18]Shu-Wei Chang, Jian-Jhih Kuo
, Mong-Jen Kao, Bozhong Chen, Qian-Jing Wang:
Near-Optimal UAV Deployment for Delay-Bounded Data Collection in IoT Networks. INFOCOM 2024: 111-120- 2023
- [c17]Mong-Jen Kao:
Improved Approximation Algorithm for Capacitated Facility Location with Uniform Facility Cost. ISAAC 2023: 45:1-45:14 - [c16]Ting-Yu Kuo, Yu-Han Chen, Andrea Frosini, Sun-Yuan Hsieh, Shi-Chun Tsai, Mong-Jen Kao:
On Min-Max Graph Balancing with Strict Negative Correlation Constraints. ISAAC 2023: 50:1-50:15 - [c15]Mong-Jen Kao:
On the Integrality Gap of MFN Relaxation for the Capacitated Facility Location Problem. SODA 2023: 1071-1089 - 2022
- [j9]Eunpyeong Hung, Mong-Jen Kao:
Approximation Algorithm for Vertex Cover with Multiple Covering Constraints. Algorithmica 84(1): 1-12 (2022) - 2021
- [j8]Mong-Jen Kao:
Iterative Partial Rounding for Vertex Cover with Hard Capacities. Algorithmica 83(1): 45-71 (2021) - [i9]Mong-Jen Kao:
Improved LP-based Approximation Algorithms for Facility Location with Hard Capacities. CoRR abs/2102.06613 (2021)
2010 – 2019
- 2019
- [j7]Mong-Jen Kao, Hai-Lun Tu, D. T. Lee:
O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities. Algorithmica 81(5): 1800-1817 (2019) - [j6]Mong-Jen Kao, Jia-Yau Shiau, Ching-Chi Lin, D. T. Lee:
Tight approximation for partial vertex cover with hard capacities. Theor. Comput. Sci. 778: 61-72 (2019) - 2018
- [c14]Hai-Lun Tu, Mong-Jen Kao, D. T. Lee:
An O(f) Bi-approximation for Weighted Capacitated Covering with Hard Capacity. ICS 2018: 468-475 - [c13]Hung-I Yu, Mong-Jen Kao, D. T. Lee:
The Multi-service Location Problems. ICS 2018: 507-515 - [c12]Eunpyeong Hong, Mong-Jen Kao:
Approximation Algorithm for Vertex Cover with Multiple Covering Constraints. ISAAC 2018: 43:1-43:11 - 2017
- [c11]Jia-Yau Shiau, Mong-Jen Kao, Ching-Chi Lin, D. T. Lee:
Tight Approximation for Partial Vertex Cover with Hard Capacities. ISAAC 2017: 64:1-64:13 - [c10]Mong-Jen Kao:
Iterative Partial Rounding for Vertex Cover with Hard Capacities. SODA 2017: 2638-2653 - 2016
- [j5]Bang-Sin Dai, Mong-Jen Kao, D. T. Lee:
Optimal time-convex hull for a straight-line highway in Lp-metrics. Comput. Geom. 53: 1-20 (2016) - [c9]Mong-Jen Kao, Hai-Lun Tu, D. T. Lee:
O(f) Bi-Approximation for Capacitated Covering with Hard Capacities. ISAAC 2016: 40:1-40:12 - [i8]Mong-Jen Kao:
Iterative Partial Rounding for Vertex Cover with Hard Capacities. CoRR abs/1606.08667 (2016) - [i7]Mong-Jen Kao, Hai-Lun Tu, D. T. Lee:
O(f) Bi-Approximation for Capacitated Covering with Hard Capacities. CoRR abs/1609.02640 (2016) - 2015
- [j4]Mong-Jen Kao, Han-Lin Chen, D. T. Lee:
Capacitated Domination: Problem Complexity and Approximation Algorithms. Algorithmica 72(1): 1-43 (2015) - [j3]Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner:
Online dynamic power management with hard real-time guarantees. Theor. Comput. Sci. 595: 46-64 (2015) - 2014
- [c8]Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner:
Online Dynamic Power Management with Hard Real-Time Guarantees. STACS 2014: 226-238 - 2013
- [j2]Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner:
The density maximization problem in graphs. J. Comb. Optim. 26(4): 723-754 (2013) - [c7]Bang-Sin Dai, Mong-Jen Kao, D. T. Lee:
Optimal Time-Convex Hull under the L p Metrics. WADS 2013: 268-279 - [i6]Mong-Jen Kao, Der-Tsai Lee, Dorothea Wagner:
Approximating Metrics by Tree Metrics of Small Distance-Weighted Average Stretch. CoRR abs/1301.3252 (2013) - [i5]Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner:
Online Power-Managing Strategy with Hard Real-Time Guarantees. CoRR abs/1304.1590 (2013) - [i4]Bang-Sin Dai, Mong-Jen Kao, D. T. Lee:
Optimal Time-Convex Hull under the Lp Metrics. CoRR abs/1304.7833 (2013) - [i3]Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter, Dorothea Wagner:
Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem. CoRR abs/1309.5697 (2013) - 2012
- [c6]Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter, Dorothea Wagner:
Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem. ISAAC 2012: 75-84 - 2011
- [j1]Mong-Jen Kao, Chung-Shou Liao, D. T. Lee:
Capacitated Domination Problem. Algorithmica 60(2): 274-300 (2011) - [c5]Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner:
Connecting Two Trees with Optimal Routing Cost. CCCG 2011 - [c4]Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner:
The Density Maximization Problem in Graphs. COCOON 2011: 25-36 - [c3]Mong-Jen Kao, D. T. Lee:
Capacitated Domination: Constant Factor Approximations for Planar Graphs. ISAAC 2011: 494-503 - [i2]Mong-Jen Kao, D. T. Lee:
Capacitated Domination: Constant Factor Approximation for Planar Graphs. CoRR abs/1108.4606 (2011) - 2010
- [c2]Mong-Jen Kao, Han-Lin Chen:
Approximation Algorithms for the Capacitated Domination Problem. FAW 2010: 185-196 - [i1]Mong-Jen Kao, Han-Lin Chen:
Approximation Algorithms for the Capacitated Domination Problem. CoRR abs/1004.2839 (2010)
2000 – 2009
- 2007
- [c1]Mong-Jen Kao, Chung-Shou Liao:
Capacitated Domination Problem. ISAAC 2007: 256-267
Coauthor Index
aka: Der-Tsai Lee
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
