Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
October 1, 2006ACM Transactions on Algorithms

A general approach to online network optimization problems

View Full Paper
Ask AI
Bookmark
Share

Authors

NANoga AlonRutgers, The State University of New JerseyBABaruch AwerbuchJohns Hopkins UniversityYAYossi AzarTel Aviv University

Discussion

Loading...

Member takes

Implication

Key Points

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

Cite This Study

Alon et al. (2006) studied this question.

synapsesocial.com/papers/6a1ebdaebf2a5d44faaf4170https://doi.org/10.1145/1198513.1198522
View Full Paper
Ask AI
Bookmark
Share

Also Consider

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

  1. 1Fast Approximation Algorithms for Fractional Packing and Covering Problems1995 · 551 citations
  2. 2Dynamic Steiner Tree Problem1991 · 362 citations
  3. 3Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications1996 · 336 citations