Approximation and Online Algorithms

DOI10.1007/B106130zbMATH Open1124.68374OpenAlexW4299357393MaRDI QIDQ5713445FDOQ5713445

Dániel Marx

Publication date: 14 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b106130

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Cited In (4)

• Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees
• On a local protocol for concurrent file transfers
• Complexity results for minimum sum edge coloring
• Title not available (Why is that?)

   Recommendations

• Approximation and Online Algorithms 👍 👎
• Minimum sum multicoloring on the edges of trees 👍 👎
• Title not available (Why is that?) 👍 👎
• Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees 👍 👎
• Edge-chromatic sum of trees and bounded cyclicity graphs 👍 👎

This page was built for publication: Approximation and Online Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713445)