Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
April 1, 1995SIAM Journal on Computing

A General Approximation Technique for Constrained Forest Problems

View Full Paper
Ask AI
Bookmark
Share

Authors

MGMichel X. GoemansAgency for Science, Technology and ResearchDWDavid P. WilliamsonCornell University

Discussion

Loading...

Member takes

Implication

Key Points

Key points are not available for this paper at this time.

Cite This Study

Goemans et al. (1995) studied this question.

synapsesocial.com/papers/6a6f8736febe604dd7086ec6https://doi.org/10.1137/s0097539793242618
View Full Paper
Ask AI
Bookmark
Share

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1The prize collecting traveling salesman problem1989 · 572 citations
  2. 2Maximum matching and a polyhedron with 0,1-vertices1965 · 1,733 citations
  3. 3Finding the Shortest Route between Two Points in a Network1966 · 162 citations
  4. 4Efficiency of a Good But Not Linear Set Union Algorithm1975 · 1,418 citations
  5. 5When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks1995 · 422 citations