scientific article; zbMATH DE number 1947051

zbMath1013.90110MaRDI QIDQ4411281

Eran Ofek, Udi Wieder, Uriel Feige

Publication date: 7 July 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2462/24620108.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (18)

Characterization of saturated graphs related to pairs of disjoint matchings ⋮ Parameterized and approximation algorithms for finding two disjoint matchings ⋮ Approximating maximum edge 2-coloring in simple graphs ⋮ Efficiently list‐edge coloring multigraphs asymptotically optimally ⋮ Pairs of disjoint matchings and related classes of graphs ⋮ Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement ⋮ Online edge coloring of paths and trees with a fixed number of colors ⋮ An improved approximation algorithm for maximum edge 2-coloring in simple graphs ⋮ Packing \([1, \Delta \)-factors in graphs of small degree] ⋮ Diverse Pairs of Matchings ⋮ Approximating the maximum 2- and 3-edge-colorable subgraph problems ⋮ Parameterized complexity of \textsc{maximum edge colorable subgraph} ⋮ Approximation algorithm for maximum edge coloring ⋮ Approximating maximum edge 2-coloring in simple graphs via local improvement ⋮ Approximating the maximum 3-edge-colorable subgraph problem ⋮ Parameterized complexity of maximum edge colorable subgraph ⋮ Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings ⋮ \((p,k)\)-coloring problems in line graphs

This page was built for publication: