default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJingyang Zhao 0001
Person information
- affiliation: University of Electronic Science and Technology of China, Chengdu, Sichuan, China
Other persons with the same name
- Jingyang Zhao 0002
![[0000-0003-1499-8580]](https://dblp.org/img/orcid-mark.12x12.png "0000-0003-1499-8580")
— Huazhong University of Science and Technology, Wuhan, China - Jingyang Zhao 0003 — Huawei Cloud Co., Ltd., China
- Jingyang Zhao 0004 — Henan University of Technology, Zhengzhou, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Jingyang Zhao, Mingyu Xiao:
A deterministic approximation algorithm for metric triangle packing. Theor. Comput. Sci. 1010: 114699 (2024)- [c10]Jingyang Zhao, Mingyu Xiao, Shunwang Wang:
Improved Approximation Algorithms for Capacitated Location Routing. IJCAI 2024: 6805-6813 - [c9]Jingyang Zhao, Mingyu Xiao:
A Better Approximation for Bipartite Traveling Tournament in Inter-League Sports Scheduling. IJCAI 2024: 6814-6822 - [c8]Jingyang Zhao, Mingyu Xiao:
An Improved Approximation Algorithm for Metric Triangle Packing. TAMC 2024: 50-62 - [c7]Jingyang Zhao, Mingyu Xiao:
Improved Approximation Algorithms for Cycle and Path Packings. WALCOM 2024: 179-193 - [i9]Jingyang Zhao, Mingyu Xiao:
An Improved Approximation Algorithm for Metric Triangle Packing. CoRR abs/2402.08216 (2024) - [i8]Jingyang Zhao, Mingyu Xiao, Chao Xu:
The Traveling Tournament Problem: Improved Algorithms Based on Cycle Packing. CoRR abs/2404.10955 (2024) - 2023
- [j1]Binglin Tao, Mingyu Xiao, Jingyang Zhao:
Minimum-Weight Link-Disjoint Paths With a Bounded Number of Shared Nodes. IEEE Trans. Netw. Serv. Manag. 20(3): 2598-2610 (2023) - [c6]Jingyang Zhao, Mingyu Xiao:
The Linear Distance Traveling Tournament Problem Allows an EPTAS. AAAI 2023: 12155-12162 - [c5]Jingyang Zhao, Mingyu Xiao:
Improved Approximation Algorithms for Multidepot Capacitated Vehicle Routing. COCOON (2) 2023: 378-391 - [i7]Jingyang Zhao, Mingyu Xiao:
The APX-hardness of the Traveling Tournament Problem. CoRR abs/2308.14124 (2023) - [i6]Jingyang Zhao, Mingyu Xiao:
Improved Approximation Algorithms for Multidepot Capacitated Vehicle Routing. CoRR abs/2308.14131 (2023) - [i5]Jingyang Zhao, Mingyu Xiao:
A 5-approximation Algorithm for the Traveling Tournament Problem. CoRR abs/2309.01902 (2023) - [i4]Jingyang Zhao, Mingyu Xiao:
Improved Approximation Algorithms for Cycle and Path Packings. CoRR abs/2311.11332 (2023) - 2022
- [c4]Jingyang Zhao, Mingyu Xiao, Chao Xu:
Improved Approximation Algorithms for the Traveling Tournament Problem. MFCS 2022: 83:1-83:15 - [i3]Jingyang Zhao, Mingyu Xiao:
Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity. CoRR abs/2210.16534 (2022) - [i2]Jingyang Zhao, Mingyu Xiao:
Practical Algorithms with Guaranteed Approximation Ratio for TTP with Maximum Tour Length Two. CoRR abs/2212.12240 (2022) - 2021
- [c3]Jingyang Zhao, Mingyu Xiao:
A Further Improvement on Approximating TTP-2. COCOON 2021: 137-149 - [c2]Jingyang Zhao, Mingyu Xiao:
The Traveling Tournament Problem with Maximum Tour Length Two: A Practical Algorithm with An Improved Approximation Bound. IJCAI 2021: 4206-4212 - [i1]Jingyang Zhao, Mingyu Xiao:
A Further Improvement on Approximating TTP-2. CoRR abs/2108.13060 (2021) - 2020
- [c1]Binglin Tao, Mingyu Xiao, Jingyang Zhao:
Finding Minimum-Weight Link-Disjoint Paths with a Few Common Nodes. AAAI 2020: 938-945
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-10-21 20:31 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:
