default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHyung-Chan An
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j9]Kangsan Kim, Yongho Shin, Hyung-Chan An
:
Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location and k-Center. Algorithmica 85(7): 1883-1911 (2023)- [c8]Yongho Shin, Changyeol Lee, Gukryeol Lee, Hyung-Chan An:
Improved Learning-Augmented Algorithms for the Multi-Option Ski Rental Problem via Best-Possible Competitive Analysis. ICML 2023: 31539-31561 - [i13]Yongho Shin, Changyeol Lee, Gukryeol Lee, Hyung-Chan An:
Improved Learning-Augmented Algorithms for the Multi-Option Ski Rental Problem via Best-Possible Competitive Analysis. CoRR abs/2302.06832 (2023) - [i12]Yongho Shin, Changyeol Lee, Hyung-Chan An:
On Optimal Consistency-Robustness Trade-Off for Learning-Augmented Multi-Option Ski Rental. CoRR abs/2312.02547 (2023) - 2022
- [j8]Hyung-Chan An, Robert Kleinberg:
A diameter-revealing proof of the Bondy-Lovász lemma. Inf. Process. Lett. 174: 106194 (2022) - 2021
- [j7]Hyung-Chan An, Hoeseok Yang:
Fully Adaptive Stochastic Handling of Soft-Errors in Real-Time Systems. IEEE Access 9: 155058-155071 (2021) - [j6]Hyung-Chan An, Robert Kleinberg, David B. Shmoys:
Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem. ACM Trans. Algorithms 17(4): 35:1-35:12 (2021) - [c7]Yongho Shin, Hyung-Chan An:
Making Three out of Two: Three-Way Online Correlated Selection. ISAAC 2021: 49:1-49:17 - [i11]Yongho Shin, Hyung-Chan An:
Making Three Out of Two: Three-Way Online Correlated Selection. CoRR abs/2107.02605 (2021) - 2020
- [c6]Kangsan Kim, Yongho Shin, Hyung-Chan An:
Constant-Factor Approximation Algorithms for the Parity-Constrained Facility Location Problem. ISAAC 2020: 21:1-21:17 - [i10]Yongho Shin, Kangsan Kim, Seungmin Lee, Hyung-Chan An:
Online Graph Matching Problems with a Worst-Case Reassignment Budget. CoRR abs/2003.05175 (2020) - [i9]Hyung-Chan An, Robert Kleinberg, David B. Shmoys:
Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem. CoRR abs/2012.14233 (2020)
2010 – 2019
- 2019
- [i8]Kangsan Kim, Yongho Shin, Hyung-Chan An:
Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location Problems. CoRR abs/1907.03129 (2019) - 2017
- [j5]Hyung-Chan An, Mohit Singh, Ola Svensson:
LP-Based Algorithms for Capacitated Facility Location. SIAM J. Comput. 46(1): 272-306 (2017) - [j4]Hyung-Chan An, Ashkan Norouzi-Fard, Ola Svensson:
Dynamic Facility Location via Exponential Clocks. ACM Trans. Algorithms 13(2): 21:1-21:20 (2017) - 2016
- [j3]Hyung-Chan An, Hoeseok Yang, Soonhoi Ha:
A Formal Approach to Power Optimization in CPSs With Delay-Workload Dependence Awareness. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 35(5): 750-763 (2016) - [i7]Hyung-Chan An, Hoeseok Yang, Soonhoi Ha:
A Formal Approach to Power Optimization in CPSs with Delay-Workload Dependence Awareness. CoRR abs/1601.08046 (2016) - 2015
- [j2]Hyung-Chan An, Robert D. Kleinberg, David B. Shmoys:
Improving Christofides' Algorithm for the s-t Path TSP. J. ACM 62(5): 34:1-34:28 (2015) - [j1]Hyung-Chan An, Aditya Bhaskara, Chandra Chekuri, Shalmoli Gupta, Vivek Madan, Ola Svensson:
Centrality of trees for capacitated k-center. Math. Program. 154(1-2): 29-53 (2015) - [c5]Hyung-Chan An, Ashkan Norouzi-Fard, Ola Svensson:
Dynamic Facility Location via Exponential Clocks. SODA 2015: 708-721 - 2014
- [c4]Hyung-Chan An, Mohit Singh, Ola Svensson:
LP-Based Algorithms for Capacitated Facility Location. FOCS 2014: 256-265 - [c3]Hyung-Chan An, Aditya Bhaskara, Chandra Chekuri, Shalmoli Gupta, Vivek Madan, Ola Svensson:
Centrality of Trees for Capacitated k-Center. IPCO 2014: 52-63 - [i6]Hyung-Chan An, Mohit Singh, Ola Svensson:
LP-Based Algorithms for Capacitated Facility Location. CoRR abs/1407.3263 (2014) - [i5]Hyung-Chan An, Ashkan Norouzi-Fard, Ola Svensson:
Dynamic Facility Location via Exponential Clocks. CoRR abs/1411.4476 (2014) - 2013
- [i4]Hyung-Chan An, Aditya Bhaskara, Ola Svensson:
Centrality of Trees for Capacitated k-Center. CoRR abs/1304.2983 (2013) - 2012
- [b1]Hyung-Chan An:
Approximation Algorithms for Traveling Salesman Problems Based on Linear Programming Relaxations. Cornell University, USA, 2012 - [c2]Hyung-Chan An, Robert Kleinberg, David B. Shmoys:
Improving christofides' algorithm for the s-t path TSP. STOC 2012: 875-886 - 2011
- [i3]Hyung-Chan An, David B. Shmoys:
LP-Based Approximation Algorithms for Traveling Salesman Path Problems. CoRR abs/1105.2391 (2011) - [i2]Hyung-Chan An, Robert Kleinberg, David B. Shmoys:
Improving Christofides' Algorithm for the s-t Path TSP. CoRR abs/1110.4604 (2011) - [i1]Hyung-Chan An, Robert Kleinberg:
A Diameter-Revealing Proof of the Bondy-Lovász Lemma. CoRR abs/1111.6561 (2011) - 2010
- [c1]Hyung-Chan An, Robert D. Kleinberg, David B. Shmoys:
Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem. APPROX-RANDOM 2010: 1-11
Coauthor Index
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-04-24 23:05 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:
