Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs

Published 2011 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs
Authors
Keywords
-
Journal
ALGORITHMICA
Volume 63, Issue 1-2, Pages 425-456
Publisher
Springer Nature
Online
2011-06-15
DOI
10.1007/s00453-011-9540-3
References
View 1 related references

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.