Vai al contenuto principale della pagina

Bounded Incremental Computation [[electronic resource] /] / by G. Ramalingam



(Visualizza in formato marc)    (Visualizza in BIBFRAME)

Autore: Ramalingam G Visualizza persona
Titolo: Bounded Incremental Computation [[electronic resource] /] / by G. Ramalingam Visualizza cluster
Pubblicazione: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996
Edizione: 1st ed. 1996.
Descrizione fisica: 1 online resource (XII, 196 p.)
Disciplina: 004/.01/5114
Soggetto topico: Algorithms
Combinatorics
Computers
Operating systems (Computers)
Algorithm Analysis and Problem Complexity
Computation by Abstract Devices
Operating Systems
Note generali: Bibliographic Level Mode of Issuance: Monograph
Nota di contenuto: On incremental algorithms and their complexity -- Terminology and notation -- Incremental algorithms for shortest-path problems -- Generalizations of the shortest-path problem -- An incremental algorithm for a generalization of the shortest-path problem -- Incremental algorithms for the circuit value annotation problem -- Inherently unbounded incremental computation problems -- Incremental algorithms for reducible flowgraphs -- Conclusions.
Sommario/riassunto: Incremental computation concerns the re-computation of output after a change in the input, whereas algorithms and programs usually derive their output directly from their input. This book investigates the concept of incremental computation and dynamic algorithms in general and provides a variety of new results, especially for computational problems from graph theory: the author presents e.g. efficient incremental algorithms for several shortest-path problems as well as incremental algorithms for the circuit value annotation problem and for various computations in reducible flow graphs.
Titolo autorizzato: Bounded Incremental Computation  Visualizza cluster
ISBN: 3-540-68458-1
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 996465329103316
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Serie: Lecture Notes in Computer Science, . 0302-9743 ; ; 1089
Approximation Algorithms for Combinatorial Optimization [[electronic resource] ] : Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings / / edited by Klaus Jansen, Samir Khuller
Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques [[electronic resource] ] : 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA,USA, August 18-20, 2001 / / edited by Michel Goemans, Klaus Jansen, Jose D.P. Rolim, Luca Trevisan
Randomization and Approximation Techniques in Computer Science [[electronic resource] ] : International Workshop RANDOM'97, Bologna, Italy, July 11-12, 1997 Proceedings / / edited by Jose Rolim
Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques : 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA,USA, August 18-20, 2001 / / edited by Michel Goemans, Klaus Jansen, Jose D.P. Rolim, Luca Trevisan
Randomization and Approximation Techniques in Computer Science [[electronic resource] ] : International Workshop RANDOM'97, Bologna, Italy, July 11-12, 1997 Proceedings / / edited by Jose Rolim