Efficient algorithms for the conditional covering problem (Q690494): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ic.2012.08.003 / rank
Normal rank
 
Property / author
 
Property / author: Binay K. Bhattacharya / rank
Normal rank
 
Property / author
 
Property / author: Binay K. Bhattacharya / rank
 
Normal rank
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.ic.2012.08.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2085731892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Domination and Irredundance in Weighted Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New heuristics for the conditional covering problem / 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: Total domination in 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: A dynamic programming algorithm for the conditional covering problem on tree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Algorithmic Complexity of Total Domination / 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: 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
Property / cites work
 
Property / cites work: Q3688433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3171770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On conditional covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Location of Emergency Service Facilities / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IC.2012.08.003 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:49, 10 December 2024

scientific article
Language Label Description Also known as
English
Efficient algorithms for the conditional covering problem
scientific article

    Statements

    Efficient algorithms for the conditional covering problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 November 2012
    0 references
    algorithms
    0 references
    graphs
    0 references
    covering location problems
    0 references
    conditional covering
    0 references
    dynamic programming
    0 references

    Identifiers