Dynamic problem (algorithms)

Known as: Dynamic Algorithms, Dynamic algorithm, Dynamic problem 
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

1967-2017
05010019672017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
We consider several well-studied problems in dynamic algorithms and prove that sufficient progress on any of them would imply a… (More)
  • table I
  • table II
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there… (More)
  • figure 1
  • table 1
  • table 2
  • table 4
  • table 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Algorithm selection can be performed using a model of runtime distribution, learned during a preliminary training phase. There is… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Evolutionary algorithms have been widely used for stationary optimization problems. However, the environments of real world… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • table 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1999
Highly Cited
1999
This paper solves a longstanding open problem in fully dynamic algorithms: We present the first fully dynamic algorithms that… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Motivated by applications such as document and image classification in information retrieval, we consider the problem of… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We provide data strutures that maintain a graph as edges are inserted and deleted, and keep track of the following properties… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh A common way to evaluate the time… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
This paper solves a longstanding open problem in dynamic algorithms: We present the first dynamic algorithms that maintain… (More)
Is this relevant?