A note on optimal covering augmentation for graphic polymatroids.

DOI10.1016/S0020-0190(01)00140-5MaRDI QIDQ1603399zbMATH OpenFDO

Authors H. Narayanan, Sachin Patkar

Publication date 14 July 2002

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0020-0190(01)00140-5

zbMATH Keywords

AlgorithmsAnalysis of algorithmsCombinatorial problemsDesign of algorithmsGraphPolymatroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Nonnumerical algorithms (68W05)

Recommendations

• Algorithms for Graphic Polymatroids and Parametrics-Sets
• Approximation algorithms for graph augmentation
• Publication:4886037
• Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems
• Edge-augmentation of hypergraphs

Cites work

• A Fast Parametric Maximum Flow Algorithm and Applications
• A faster algorithm for computing the strength of a network
• A new approach to the maximum-flow problem
• Algorithms for Graphic Polymatroids and Parametrics-Sets
• Approximation Algorithms for Min-k-Overlap Problems Using the Principal Lattice of Partitions Approach
• scientific article; zbMATH DE number 742961 (Why is no real title available?)
• scientific article; zbMATH DE number 3422402 (Why is no real title available?)
• Improved Algorithms for Bipartite Network Flow
• Optimal attack and reinforcement of a network
• Submodular functions and electrical networks
• Submodular functions and optimization

Cited in

(3)

• Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems
• Algorithms for Graphic Polymatroids and Parametrics-Sets
• scientific article; zbMATH DE number 910863 (Why is no real title available?)

This page was built for publication: A note on optimal covering augmentation for graphic polymatroids.

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