Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:3002765
Jump to:navigation, search

DOI10.4086/toc.2006.v002a003zbMath1213.68705OpenAlexW2170170950MaRDI QIDQ3002765

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: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

network designapproximation algorithmsrandomized algorithmsSteiner trees


Mathematics Subject Classification ID

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





This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3002765&oldid=16022308"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 21:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki