A strongly polynomial algorithm for minimum cost submodular flow problems
Mathematics of Operations Research
Centroids, representations, and submodular flows
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
Computer Networks and ISDN Systems
An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs
Information Sciences: an International Journal
Adaptive hybrid clock discipline algorithm for the network time protocol
IEEE/ACM Transactions on Networking (TON)
QoS routing in networks with uncertain parameters
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Understanding and improving TCP performance over networks with minimum rate guarantees
IEEE/ACM Transactions on Networking (TON)
Computer networks: a systems approach
Computer networks: a systems approach
Database Location in Computer Networks
Journal of the ACM (JACM)
Monitoring QoS distribution in multimedia networks
International Journal of Network Management
Challenges and approaches in providing QoS monitoring
International Journal of Network Management
An orientation theorem with parity conditions
Discrete Applied Mathematics - Special issue on selected papers from First Japanese-Hungarian Symposium for Discrete Mathematics and its Applications
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Introduction to Algorithms
QoS-Sensitive Flows: Issues in IP Packet Handling
IEEE Internet Computing
Parity Constrained k-Edge-Connected Orientations
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Discrete Applied Mathematics
Series-parallel orientations preserving the cycle-radius
Information Processing Letters
| Hi-index | 0.07 |
Let G(V,E) be a connected undirected graph with n vertices and m edges, where each vertex v is associated with a cost C(v) and each edge e=(u,v) is associated with two weights, W(u-v) and W(v-u). The issue of assigning an orientation to each edge so that G becomes a directed graph is resolved in this paper. Determining a scheme to assign orientations of all edges such that max"x"@?"VC(x)+@?"x"-"zW(x-z) is minimized is the objective. This issue is called the edge-orientation problem (the EOP). Two variants of the EOP, the Out-Degree-EOP and the Vertex-Weighted EOP, are first proposed and then efficient algorithms for solving them on general graphs are designed. Ascertaining that the EOP is NP-hard on bipartite graphs and chordal graphs is the second result. Finally, an O(nlogn)-time algorithm for the EOP on trees is designed. In general, the algorithmic results in this paper facilitate the implementation of the weighted fair queuing (WFQ) on real networks. The objective of the WFQ is to assign an effective weight for each flow to enhance link utilization. Our findings consequently can be easily extended to other classes of graphs, such as cactus graphs, block graphs, and interval graphs.