Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
April 17, 2009Mathematics of Operations Research

Online Primal-Dual Algorithms for Covering and Packing

View Full Paper
Ask AI
Bookmark
Share

Authors

NBNiv BuchbinderTel Aviv UniversityJNJoseph NaorTechnion – Israel Institute of Technology

Discussion

Loading...

Member takes

Implication

Key Points

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

Cite This Study

Buchbinder et al. (2009) studied this question.

synapsesocial.com/papers/6aaa57c1bdb30b5c2feb883bhttps://doi.org/10.1287/moor.1080.0363
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. 1A general approach to online network optimization problems2006 · 115 citations
  2. 2On-line routing of virtual circuits with applications to load balancing and machine scheduling1997 · 334 citations
  3. 3Approximating Fractional Multicommodity Flow Independent of the Number of Commodities2000 · 300 citations
  4. 4Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems2007 · 317 citations
  5. 5A General Approximation Technique for Constrained Forest Problems1995 · 850 citations