default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHao-Ting Wei
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i8]Eric Balkanski, Noémie Périvier, Clifford Stein, Hao-Ting Wei:
Energy-Efficient Scheduling with Predictions. CoRR abs/2402.17143 (2024)- 2023
- [c5]Eric Balkanski, Noémie Périvier, Clifford Stein, Hao-Ting Wei:
Energy-Efficient Scheduling with Predictions. NeurIPS 2023 - [c4]Eric Balkanski, Tingting Ou, Clifford Stein, Hao-Ting Wei:
Scheduling with Speed Predictions. WAOA 2023: 74-89 - [i7]Clifford Stein, Hao-Ting Wei:
Learning-Augmented Online Packet Scheduling with Deadlines. CoRR abs/2305.07164 (2023) - 2022
- [j1]Hao-Ting Wei, Wing-Kai Hon, Paul Horn, Chung-Shou Liao, Kunihiko Sadakane
:
Approximating Dynamic Weighted Vertex Cover with Soft Capacities. Algorithmica 84(1): 124-149 (2022) - [c3]Hao-Ting Wei, Chung-Shou Liao, Sung-Hsien Hsieh, Chun-Shien Lu:
Dynamic Network Tomography with Sparse Recovery-based Link Delay Estimation. WF-IoT 2022: 1-6 - [i6]Eric Balkanski, Tingting Ou, Clifford Stein, Hao-Ting Wei:
Scheduling with Speed Predictions. CoRR abs/2205.01247 (2022) - [i5]Hsiao-Yu Hu, Hao-Ting Wei, Meng-Hsi Li, Kai-Min Chung, Chung-Shou Liao:
Online TSP with Predictions. CoRR abs/2206.15364 (2022) - 2020
- [c2]Chun-Hsiang Chan, Bundit Laekhanukit, Hao-Ting Wei, Yuhao Zhang:
Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs. APPROX-RANDOM 2020: 63:1-63:20
2010 – 2019
- 2019
- [i4]Pei-Chuan Chen, Erik D. Demaine, Chung-Shou Liao, Hao-Ting Wei:
Waiting is not easy but worth it: the online TSP on the line revisited. CoRR abs/1907.00317 (2019) - [i3]Chun-Hsiang Chan, Bundit Laekhanukit, Hao-Ting Wei, Yuhao Zhang:
Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs. CoRR abs/1911.09150 (2019) - 2018
- [c1]Hao-Ting Wei, Wing-Kai Hon, Paul Horn, Chung-Shou Liao, Kunihiko Sadakane:
An O(1)-Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft Capacity. APPROX-RANDOM 2018: 27:1-27:14 - [i2]Hao-Ting Wei, Wing-Kai Hon, Paul Horn, Chung-Shou Liao, Kunihiko Sadakane:
An O(1)-Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft Capacity. CoRR abs/1802.05623 (2018) - [i1]Hao-Ting Wei, Sung-Hsien Hsieh, Wen-Liang Hwang, Chung-Shou Liao, Chun-Shien Lu:
Link Delay Estimation Using Sparse Recovery for Dynamic Network Tomography. CoRR abs/1812.00369 (2018)
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:03 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:
