Algorithms for placing monitors in a flow network (Q2441585): 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.1007/s00453-012-9665-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2520330486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsification—a technique for speeding up dynamic graph algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Local Search and Placement of Meters in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding <i>k</i> Cuts within Twice the Optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple 3-edge-connected component algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782696 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:00, 7 July 2024

scientific article
Language Label Description Also known as
English
Algorithms for placing monitors in a flow network
scientific article

    Statements

    Algorithms for placing monitors in a flow network (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 March 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithm
    0 references
    flow network
    0 references
    monitors
    0 references
    0 references