We stand with Ukraine  

Gang Feng

Affiliations:
  • University of Wisconsin, Platteville, Department of Electrical Engineering, WI, USA


According to our database1, Gang Feng authored at least 14 papers between 2004 and 2015.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2015
Finding Multi-Constrained Multiple Shortest Paths.
[BibTeX]
[DOI]
Gang Feng
,
Turgay Korkmaz
IEEE Trans. Computers, 2015

2014
Improving Space Efficiency With Path Length Prediction for Finding k Shortest Simple Paths.
[BibTeX]
[DOI]
Gang Feng
IEEE Trans. Computers, 2014

Finding <i>k</i> shortest simple paths in directed graphs: A node classification algorithm.
[BibTeX]
[DOI]
Gang Feng
Networks, 2014

A fast Lagrangian relaxation algorithm for finding multi-constrained multiple shortest paths.
[BibTeX]
[DOI]
Gang Feng
Proceedings of the IEEE Global Communications Conference, 2014

2013
A Fast Hybrid ε-Approximation Algorithm for Computing Constrained Shortest Paths.
[BibTeX]
[DOI]
Gang Feng
,
Turgay Korkmaz
IEEE Commun. Lett., 2013

2012
GRASP-BSMA: A fast algorithm for delay constrained multicast routing.
[BibTeX]
[DOI]
Gang Feng
Proceedings of IEEE International Conference on Communications, 2012

Delay constrained multicast routing: What can we learn from an exact approach?
[BibTeX]
[DOI]
Gang Feng
Proceedings of the 2012 IEEE Global Communications Conference, 2012

2007
The revisit of QoS routing based on non-linear Lagrange relaxation.
[BibTeX]
[DOI]
Gang Feng
Int. J. Commun. Syst., 2007

2006
A multi-constrained multicast QoS routing algorithm.
[BibTeX]
[DOI]
Gang Feng
Comput. Commun., 2006

2005
Tightest constraint first: An efficient delay sensitive multicast routing algorithm.
[BibTeX]
[DOI]
Gang Feng
Int. J. Commun. Syst., 2005

Computing delay constrained paths from one source to single/all destinations.
[BibTeX]
[DOI]
Gang Feng
Proceedings of the 14th International Conference On Computer Communications and Networks, 2005

The revisit of nonlinear Lagrange relaxation based QoS routing.
[BibTeX]
[DOI]
Gang Feng
Proceedings of IEEE International Conference on Communications, 2005

Nonlinear Lagrange relaxation based QoS routing revisited.
[BibTeX]
[DOI]
Gang Feng
Proceedings of the 2nd IEEE Consumer Communications and Networking Conference, 2005

2004
On the Performance of Heuristic H MCOP for Multi-Constrained Optimal-Path QoS Routing.
[BibTeX]
[DOI]
Gang Feng
Proceedings of the 18th International Conference on Advanced Information Networking and Applications (AINA 2004), 2004


  Loading...