Improved approximation of the minimum cover time (Q2566000): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2005.03.042 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1970421460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collisions Among Random Walks on a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3706275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic approximation of the cover time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering problems for Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks and the effective resistance of networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Extension of Foster's Network Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of On-Line Algorithms Using Hitting Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284630 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:32, 10 June 2024

scientific article
Language Label Description Also known as
English
Improved approximation of the minimum cover time
scientific article

    Statements

    Improved approximation of the minimum cover time (English)
    0 references
    0 references
    0 references
    22 September 2005
    0 references
    Random walks
    0 references
    Markov chains
    0 references
    Cover time
    0 references
    Approximation algorithms
    0 references

    Identifiers