Dynamic problem

Known as: Dynamic Algorithms, Dynamic algorithm 
Dynamic problems in computational complexity theory are problems stated in terms of the changing input data. In the most general form a problem in… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1988-2017
051019882017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
We present the first dynamic shortest paths algorithms that make any progress beyond a long-standing <i>O</i>(<i>n</i>) update… (More)
  • figure 1
Is this relevant?
2011
2011
We present faster and dynamic algorithms for the following problems arising in probabilistic verification: Computation of the… (More)
  • table 1
Is this relevant?
2010
2010
An infrastructure-as-a-service cloud system provides computational capacities to remote users. Parallel processing in the cloud… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2009
Highly Cited
2009
The problem of multiple multicast sessions with intra-session network coding in time-varying networks is considered. The network… (More)
  • figure 1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We propose fully dynamic algorithms for maintaining the distances and the shortest paths from a single source in either a… (More)
Is this relevant?
2000
2000
While the exploitation of problem structure by heuristic search techniques has a long history in AI (Simon, 1973), many of the… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Let S be a set of n points in d-space aild let 1 :5 k :5 n be an integer. A unified approach is given for solving the problem of… (More)
Is this relevant?