Capacitated Domination Problem (Q5387762): 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/978-3-540-77120-3_24 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1495879230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Search Heuristics for <i>k</i>-Median and Facility Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time approximation algorithm for the weighted vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Problems with Hard Capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for capacitated facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for vertex cover with hard capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependent rounding and its applications to approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated vertex covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new greedy approach for facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of a Local Search Heuristic for Facility Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspect of \(k\)-tuple domination in graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-tuple domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ratio of optimal integral and fractional covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Metric Facility Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:54, 28 June 2024

scientific article; zbMATH DE number 5279455
Language Label Description Also known as
English
Capacitated Domination Problem
scientific article; zbMATH DE number 5279455

    Statements

    Capacitated Domination Problem (English)
    0 references
    0 references
    0 references
    27 May 2008
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references