SIGN IN
SIGN UP
Set connectivity problems in undirected graphs and the directed steiner network problem
Full Text:
PDF
Buy this Article
Authors:
Chandra Chekuri
University of Illinois, Urbana, IL
Guy Even
Tel-Aviv University, Tel-Aviv, Israel
Anupam Gupta
Carnegie Mellon University, Pittsburgh, PA
Danny Segev
University of Haifa, Haifa, Israel
2011 Article
Research
Refereed
Bibliometrics
· Downloads (6 Weeks): 10
· Downloads (12 Months): 82
· Downloads (cumulative): 269
· Citation Count: 1
Published in:
· Journal
ACM Transactions on Algorithms (TALG)
TALG Homepage
archive
Volume 7 Issue 2, March 2011
Article No. 18
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1921659.1921664
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
approximation algorithms
directed steiner network
generalized connectivity
nonnumerical algorithms and problems
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder