Approximation and Online Algorithms

DOI10.1007/B106130zbMATH Open1124.68457OpenAlexW4299357393MaRDI QIDQ5713436FDOQ5713436

D. Bilò, Guido Proietti

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) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Biconnectivity approximations and graph carvings 👍 👎
• Improving on the 1. 5-approximation of a smallest 2-edge connected spanning subgraph 👍 👎
• Title not available (Why is that?) 👍 👎

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 Q5713436)