Power optimization for connectivity problems (Q877193): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-006-0057-5 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-006-0057-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2162071758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Algorithm for the Minimum-Cost <i>k</i>-Vertex Connected Subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of submodular flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Uniform Connectivity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biconnectivity approximations and graph carvings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power consumption in packet radio networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating node connectivity problems via set covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithm for k-node connected subgraphs via critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Strongly Polynomial Minimum Cost Flow Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parallel Repetition Theorem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-006-0057-5 / rank
 
Normal rank

Latest revision as of 06:34, 10 December 2024

scientific article
Language Label Description Also known as
English
Power optimization for connectivity problems
scientific article

    Statements

    Power optimization for connectivity problems (English)
    0 references
    0 references
    0 references
    0 references
    19 April 2007
    0 references

    Identifiers

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