Edge Coloring and Decompositions of Weighted Graphs

  title={Edge Coloring and Decompositions of Weighted Graphs},
  author={U. Feige and M. Singh},
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given an edge-weighted bipartite graph G= (V,E) with weights w:Ei¾?[0,1]. The task is to find a proper weighted coloringof the edges with as few colors as possible. An edge coloring of the weighted graph is called a proper weighted coloringif the sum of the weights of the edges incident to a vertex of any color is at most… Expand
8 Citations
On Weighted Bipartite Edge Coloring
  • 4
  • PDF
Weighted-Edge-Coloring of k-degenerate Graphs and Bin-Packing
  • Florian Huc
  • Mathematics, Computer Science
  • J. Interconnect. Networks
  • 2011
Generalized Hypergraph Matching via Iterated Packing and Local Ratio
  • 19
  • PDF
Equitable factorizations of edge-connected graphs
  • Highly Influenced
  • PDF
Approximation algorithms for multidimensional bin packing
  • A. Khan
  • Computer Science, Mathematics
  • 2015
  • 12
  • Highly Influenced
  • PDF


Improved Bounds on Nonblocking 3-Stage Clos Networks
  • 15
  • PDF
Some remarks about factors of graphs
  • 4
  • PDF
[a, B]-factors of Graphs
  • 32
  • Highly Influential
  • PDF
On Multirate Rearrangeable Clos Networks
  • 27
On Rearrangeability of Multirate Clos Networks
  • 15
  • PDF
A Generalization of a Theorem of
  • 221
"Integer-making" theorems
  • 222
  • PDF
On Nonblocking Multirate Interconnection Networks
  • 63
A generalization of a theorem of König
  • 6