Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements (Q3602838): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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-93980-1_14 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1537804457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The prize collecting traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the prize collecting traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharing the cost of multicast transmissions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survivable networks, linear programming relaxations and the parsimonious property / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Approximation Technique for Constrained Forest Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A factor 2 approximation algorithm for the generalized Steiner network problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Approximation Algorithm for Connectivity Augmentation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual approximation algorithm for generalized Steiner network problems / rank
 
Normal rank

Latest revision as of 01:17, 29 June 2024

scientific article
Language Label Description Also known as
English
Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements
scientific article

    Statements

    Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements (English)
    0 references
    0 references
    0 references
    12 February 2009
    0 references

    Identifiers

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