logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees

delete1995-07-01
delete0
PRE
AI
DOI：10.1006/jagm.1995.1029delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En

Journal

No journal information available

Organization

No organization information available
Cited Papers

Cited Papers

No cited papers available