Weighted inverse minimum cut problem under the sum-type Hamming distance

DOI10.1007/978-3-642-29700-7_3zbMATH Open1304.90210OpenAlexW1588184679MaRDI QIDQ2897979FDOQ2897979

Authors: Longcheng Liu, Yong Chen, Biao Wu, Enyu Yao 

Publication date: 16 July 2012

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29700-7_3

Recommendations

• A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE
• scientific article; zbMATH DE number 6535313
• Some inverse optimization problems under the Hamming distance
• Combinatorial algorithms for inverse network flow problems
• Constrained inverse minimum flow problems under the weighted Hamming distance

zbMATH Keywords

Hamming distanceinverse problemminimum cutstrongly polynomial algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited In (6)

• A weighted inverse minimum \(s-t\) cut problem with value constraint under the Bottleneck-type Hamming distance
• Title not available (Why is that?)
• A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE
• Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
• The partial inverse minimum cut problem with \(L_1\)-norm is strongly NP-hard
• Complexity of partial inverse assignment problem and partial inverse cut problem

This page was built for publication: Weighted inverse minimum cut problem under the sum-type Hamming distance

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