Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

TALG
2008

favoriteEmaildiscussreport

122views more TALG 2008»

An asymptotic approximation scheme for multigraph edge coloring

13 years 4 months ago

An asymptotic approximation scheme for multigraph edge coloring

Download www.cs.princeton.edu

Peter Sanders, David Steurer

Real-time Traffic

TALG 2008 |

claim paper

Related Content

» Edge Coloring with Delays

» An Approximate MaxSteinerTreePacking MinSteinerCut Theorem

» Improved Inapproximability Results for Maximum kColorable Subgraph

» Weighted Coloring on Planar Bipartite and Split Graphs Complexity and Improved Approximati...

» Optimal Edge Deletions for Signed Graph Balancing

» Rainbow Fair Queueing Fair Bandwidth Sharing Without PerFlow State

» Separatorbased data reduction for signed graph balancing

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2008
Where	TALG
Authors	Peter Sanders, David Steurer

Comments (0)