scientific article; zbMATH DE number 5899242

DOI10.4086/TOC.2006.V002A003zbMATH Open1213.68705OpenAlexW2170170950MaRDI QIDQ3002765FDOQ3002765

Anupam Gupta, Aravind Srinivasan

Publication date: 24 May 2011

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2006.v002a003

Title of this publication is not available (Why is that?)

zbMATH Keywords

randomized algorithmsapproximation algorithmsnetwork designSteiner trees

Mathematics Subject Classification ID

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Randomized algorithms (68W20) Approximation algorithms (68W25)

Cited In (2)

• Improved upper bounds for the Steiner ratio
• Universal approximations for TSP, Steiner tree, and set cover

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Improved Approximations for the Steiner Tree Problem 👍 👎
• A better approximation ratio for the vertex cover problem 👍 👎
• Improved solutions to the Steiner triple covering problem 👍 👎
• A faster approximation algorithm for the Steiner problem in graphs 👍 👎
• A faster approximation algorithm for the Steiner problem in graphs 👍 👎
• Approximation algorithms for the covering Steiner problem 👍 👎
• Automata, Languages and Programming 👍 👎
• An Improved Approximation Ratio to the Partial-Terminal Steiner Tree Problem 👍 👎

This page was built for publication:

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