Approximating minimum power edge-multi-covers
DOI10.1007/s10878-013-9652-6zbMath1353.90128arXiv1107.4893OpenAlexW1861812827MaRDI QIDQ498430
Publication date: 28 September 2015
Published in: Journal of Combinatorial Optimization, Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.4893
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (4)
Cites Work
- Unnamed Item
- Approximating minimum-cost edge-covers of crossing biset-families
- Approximating minimum power edge-multi-covers
- Approximating minimum-power degree and connectivity problems
- Power optimization for connectivity problems
- On minimum power connectivity problems
- Approximating minimum power covers of intersecting families and directed edge-connectivity problems
- Approximating minimum-power edge-covers and 2,3-connectivity
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
- Survivable Network Activation Problems
- Approximating Minimum-Cost $k$-Node Connected Subgraphs via Independence-Free Graphs
- Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design
- Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
This page was built for publication: Approximating minimum power edge-multi-covers
