scientific article; zbMATH DE number 437545
From MaRDI portal
Publication:3140422
Recommendations
Cited in
(19)- Faster approximation algorithms for weighted triconnectivity augmentation problems
- Coverings and structure of crossing families
- Approximations for the maximum acyclic subgraph problem
- Power assignment for k-connectivity in wireless ad hoc networks
- An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
- A fast algorithm for cactus representations of minimum cuts
- Improved approximation algorithms for single-tiered relay placement
- Structures of polyhedra determined by submodular functions on crossing families
- Power optimization in ad hoc wireless network topology control with biconnectivity requirements
- scientific article; zbMATH DE number 1542609 (Why is no real title available?)
- Centroids, Representations, and Submodular Flows
- Better algorithms for minimum weight vertex-connectivity problems
- A Representation Theorem for Union-Difference Families and Application
- Approximating directed weighted-degree constrained networks
- An efficient scaling algorithm for the minimum weight bibranching problem
- The structure of minimum vertex cuts
- Finding small dijoins in transitive closure time
- On minimum power connectivity problems
- Approximating minimum power covers of intersecting families and directed edge-connectivity problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3140422)
