1.61-approximation for min-power strong connectivity with two power levels

DOI10.1007/S10878-014-9738-9zbMATH Open1341.90133OpenAlexW2004706672MaRDI QIDQ5963620FDOQ5963620

Gruia Calinescu

Publication date: 23 February 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-014-9738-9

zbMATH Keywords

approximation algorithmpower assignmentmatroid matching

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Matching theory
• Approximating the minimum strongly connected subgraph via a matching lower bound
• Faster Algebraic Algorithms for Path and Packing Problems
• Color-coding
• Wireless network design via 3-decompositions
• Min-Power Strong Connectivity
• Algorithms - ESA 2003
• Approximating the Minimum Equivalent Digraph
• Approximate min-power strong connectivity
• Energy-efficient wireless network design
• On strongly connected digraphs with bounded cycle length
• Power assignment in radio networks with two power levels
• On the graphic matroid parity problem
• On Min-Power Steiner Tree

Cited In (2)

• Approximation algorithm for receiver interference problem in dual power wireless sensor networks
• Parameterized complexity of min-power asymmetric connectivity

This page was built for publication: 1.61-approximation for min-power strong connectivity with two power levels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963620)