default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDung T. K. Ha
Person information
- affiliation: Vietnam National University, Faculty of Information Technology, Hanoi, Vietnam
- affiliation (former): People's Security Academy, Faculty of Information and Security Technology, Hanoi, Vietnam
Other persons with the same name
- Dung Ha — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Dung T. K. Ha
, Canh V. Pham, Tan D. Tran:
Improved approximation algorithms for k-submodular maximization under a knapsack constraint. Comput. Oper. Res. 161: 106452 (2024)- [c9]Tan D. Tran, Canh V. Pham, Dung T. K. Ha, Phuong N. H. Pham:
Improved Parallel Algorithm for Non-Monotone Submodular Maximization under Knapsack Constraint. IJCAI 2024: 1961-1969 - [i3]Tan D. Tran, Canh V. Pham, Dung T. K. Ha, Phuong N. H. Pham:
Improved Parallel Algorithm for Non-Monotone Submodular Maximization under Knapsack Constraint. CoRR abs/2409.04415 (2024) - 2023
- [j4]Canh V. Pham, Dung K. Ha:
A note for approximating the submodular cover problem over integer lattice with low adaptive and query complexities. Inf. Process. Lett. 182: 106393 (2023) - [c8]Canh V. Pham, Quat V. Phu, Dung T. K. Ha:
Fast Bicriteria Approximation Algorithm for Minimum Cost Submodular Cover Problem. CSoNet 2023: 186-197 - [c7]Canh V. Pham, Tan D. Tran, Dung K. T. Ha, My T. Thai:
Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint. IJCAI 2023: 4127-4135 - [c6]Dung K. T. Ha, Canh V. Pham, Tan D. Tran, Huan X. Hoang:
Robust Approximation Algorithms for Non-Monotone k-Submodular Maximization Under a Knapsack Constraint. KSE 2023: 1-6 - [c5]Tan D. Tran, Canh V. Pham, Dung Ha:
Maximizing a $k$-Submodular Maximization Function under an Individual Knapsack Constraint. SoICT 2023: 56-62 - [i2]Canh V. Pham, Tan D. Tran, Dung K. T. Ha, My T. Thai:
Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint. CoRR abs/2305.10292 (2023) - [i1]Dung T. K. Ha, Canh V. Pham, Tan D. Tran, Huan X. Hoang:
Robust Approximation Algorithms for Non-monotone k-Submodular Maximization under a Knapsack Constraint. CoRR abs/2309.12025 (2023) - 2022
- [j3]Dung K. Ha, Canh V. Pham, Huan X. Hoang:
Submodular Maximization Subject to a Knapsack Constraint Under Noise Models. Asia Pac. J. Oper. Res. 39(6): 2250013:1-2250013:26 (2022) - [j2]Canh V. Pham, Quang C. Vu, Dung K. Ha, Tai T. Nguyen, Nguyen D. Le:
Maximizing k-submodular functions under budget constraint: applications and streaming algorithms. J. Comb. Optim. 44(1): 723-751 (2022) - [c4]Canh V. Pham, Dung K. T. Ha, Huan X. Hoang, Tan D. Tran:
Fast Streaming Algorithms for k-Submodular Maximization under a Knapsack Constraint. DSAA 2022: 1-10 - 2021
- [c3]Canh V. Pham, Quang C. Vu, Dung K. Ha, Tai T. Nguyen:
Streaming Algorithms for Budgeted k-Submodular Maximization Problem. CSoNet 2021: 27-38 - 2020
- [j1]Canh V. Pham, Dung K. T. Ha, Quang C. Vu, Anh N. Su, Huan X. Hoang:
Influence Maximization with Priority in Online Social Networks. Algorithms 13(8): 183 (2020)
2010 – 2019
- 2016
- [c2]Canh V. Pham, My T. Thai, Dung K. Ha, Dung Q. Ngo, Huan X. Hoang:
Time-Critical Viral Marketing Strategy with the Competition on Online Social Networks. CSoNet 2016: 111-122 - [c1]Canh V. Pham, Dung K. Ha, Dung Q. Ngo, Quang C. Vu, Huan X. Hoang:
A new viral marketing strategy with the competition in the large-scale online social networks. RIVF 2016: 1-6
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 21:32 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:
