scientific article
From MaRDI portal
Publication:3140422
zbMath0801.68084MaRDI QIDQ3140422
Publication date: 6 October 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
intersecting familiesset familiescrossing familiesminimum-cost dijoinminimum-cost planar feedback arc setsubmodular flow algorithms
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (13)
Improved approximation algorithms for single-tiered relay placement ⋮ Approximations for the maximum acyclic subgraph problem ⋮ Better algorithms for minimum weight vertex-connectivity problems ⋮ Power optimization in ad hoc wireless network topology control with biconnectivity requirements ⋮ Approximating directed weighted-degree constrained networks ⋮ An efficient scaling algorithm for the minimum weight bibranching problem ⋮ Unnamed Item ⋮ A fast algorithm for cactus representations of minimum cuts ⋮ On minimum power connectivity problems ⋮ Approximating minimum power covers of intersecting families and directed edge-connectivity problems ⋮ Power assignment for \(k\)-connectivity in wireless ad hoc networks ⋮ Faster approximation algorithms for weighted triconnectivity augmentation problems ⋮ An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
This page was built for publication:
