On conditional covering problem (Q626967): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11786-009-0001-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003522749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional covering: greedy heuristics and computational results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for solving the conditional covering problem on paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming algorithm for the conditional covering problem on tree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming algorithms for the conditional covering problem on path and extended star graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination and total domination on asteroidal triple-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Network Location Problems with Distance Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility location on a tree with maximum distance constraints / rank
 
Normal rank

Latest revision as of 19:38, 3 July 2024

scientific article
Language Label Description Also known as
English
On conditional covering problem
scientific article

    Statements

    On conditional covering problem (English)
    0 references
    0 references
    0 references
    0 references
    19 February 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    conditional covering problem
    0 references
    facility location
    0 references
    total domination problem
    0 references
    paths
    0 references
    interval graphs
    0 references
    0 references