Extending the quadrangle inequality to speed-up dynamic programming (Q1321816): 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/0020-0190(94)90101-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2104037408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rectilinear Steiner arborescence problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:28, 22 May 2024

scientific article
Language Label Description Also known as
English
Extending the quadrangle inequality to speed-up dynamic programming
scientific article

    Statements

    Extending the quadrangle inequality to speed-up dynamic programming (English)
    0 references
    0 references
    0 references
    3 May 1994
    0 references
    0 references
    rectilinear Steiner minimal arborescence
    0 references
    dynamic programming
    0 references
    quadrangle inequality
    0 references
    0 references