![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Gang Feng 0003
Person information
- affiliation: University of Wisconsin, Platteville, Department of Electrical Engineering, WI, USA
Other persons with the same name
- Gang Feng — disambiguation page
- Gang Feng 0001
— City University of Hong Kong, Department of Mechanical and Biomedical Engineering, Kowloon, Hong Kong (and 2 more)
- Gang Feng 0002 — CNRS, Speech and Cognition Department, Grenoble, France (and 1 more)
- Gang Feng 0004
— University of Electronic Science and Technology of China, National Key Laboratory of Science and Technology on Communications, Chengdu, China (and 2 more)
- Gang Feng 0005
— Shenzhen University, College of Computer Science and Software Engineering, China
- Gang Feng 0006
— Shenyang University of Technology, College of Information Science and Engineering, China
- Gang Feng 0007
— South China Normal University, School of Computer Science, Guangzhou, China
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j7]Gang Feng, Turgay Korkmaz:
Finding Multi-Constrained Multiple Shortest Paths. IEEE Trans. Computers 64(9): 2559-2572 (2015) - 2014
- [j6]Gang Feng:
Finding k shortest simple paths in directed graphs: A node classification algorithm. Networks 64(1): 6-17 (2014) - [j5]Gang Feng:
Improving Space Efficiency With Path Length Prediction for Finding k Shortest Simple Paths. IEEE Trans. Computers 63(10): 2459-2472 (2014) - [c7]Gang Feng:
A fast Lagrangian relaxation algorithm for finding multi-constrained multiple shortest paths. GLOBECOM 2014: 1949-1955 - 2013
- [j4]Gang Feng, Turgay Korkmaz:
A Fast Hybrid ε-Approximation Algorithm for Computing Constrained Shortest Paths. IEEE Commun. Lett. 17(7): 1471-1474 (2013) - 2012
- [c6]Gang Feng:
Delay constrained multicast routing: What can we learn from an exact approach? GLOBECOM 2012: 2809-2814 - [c5]Gang Feng:
GRASP-BSMA: A fast algorithm for delay constrained multicast routing. ICC 2012: 2833-2837
2000 – 2009
- 2007
- [j3]Gang Feng:
The revisit of QoS routing based on non-linear Lagrange relaxation. Int. J. Commun. Syst. 20(1): 9-22 (2007) - 2006
- [j2]Gang Feng:
A multi-constrained multicast QoS routing algorithm. Comput. Commun. 29(10): 1811-1822 (2006) - 2005
- [j1]Gang Feng:
Tightest constraint first: An efficient delay sensitive multicast routing algorithm. Int. J. Commun. Syst. 18(7): 671-685 (2005) - [c4]Gang Feng:
Nonlinear Lagrange relaxation based QoS routing revisited. CCNC 2005: 504-509 - [c3]Gang Feng:
The revisit of nonlinear Lagrange relaxation based QoS routing. ICC 2005: 196-200 - [c2]Gang Feng:
Computing delay constrained paths from one source to single/all destinations. ICCCN 2005: 65-70 - 2004
- [c1]Gang Feng:
On the Performance of Heuristic H MCOP for Multi-Constrained Optimal-Path QoS Routing. AINA (2) 2004: 50-53
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-08-23 19:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint