Author:
Chakrabarty Deeparnab,Könemann Jochen,Pritchard David
Subject
Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software
Reference8 articles.
1. J. Byrka, F. Grandoni, T. Rothvoß, L. Sanità, An improved LP-based approximation for Steiner tree, in: Proc. 42nd STOC, 2010, pp. 583–592.
2. Deeparnab Chakrabarty, Jochen Könemann, David Pritchard, Hypergraphic LP relaxations for Steiner trees, in: Proc. 14th IPCO, 2010, pp. 383–396. Full version at: arXiv:0910.0281.
3. Matroids and the greedy algorithm;Edmonds;Math. Program.,1971
4. Approximation algorithms for the Steiner tree problem in graphs;Gröpl,2001
5. On Steiner trees and minimum spanning trees in hypergraphs;Polzin;Oper. Res. Lett.,2003
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献