Dual-based approximation algorithms for cut-based network connectivity problems (Q722530): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963985350 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1508.05567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753746 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biconnectivity approximations and graph carvings / 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: Approximating the smallest <i>k</i> -edge connected spanning subgraph by LP-rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Minimum Equivalent Digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On strongly connected digraphs with bounded cycle length / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual power assignment optimization and fault tolerance in WSNs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power assignment in radio networks with two power levels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Min-Power Strong Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Steiner trees and minimum spanning trees in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:56, 16 July 2024

scientific article
Language Label Description Also known as
English
Dual-based approximation algorithms for cut-based network connectivity problems
scientific article

    Statements

    Dual-based approximation algorithms for cut-based network connectivity problems (English)
    0 references
    0 references
    0 references
    26 July 2018
    0 references
    approximation algorithms
    0 references
    network design
    0 references
    power assignment
    0 references
    linear programming
    0 references
    graph theory
    0 references

    Identifiers