scientific article; zbMATH DE number 1066875

zbMATH Open0879.90145MaRDI QIDQ4357799FDOQ4357799

Authors: Teodor Toadere 

Publication date: 28 September 1997

Title of this publication is not available (Why is that?)

Recommendations

• Fast and Deterministic Approximations for k-Cut.
• Fast and deterministic approximations for \(k\)-cut
• Towards Algorithmic Cut-Introduction
• Algorithmic applications of tree-cut width
• Algorithmic applications of tree-cut width
• Efficient Algorithms for the k Smallest Cuts Enumeration
• scientific article; zbMATH DE number 1003274
• Depth-optimized convexity cuts
• Computing cut-based hierarchical decompositions in almost linear time
• Approximation algorithms for minimum \(K\)-cut

zbMATH Keywords

consistencypolynomial algorithmKhachiyan's algorithmdeep cuts

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• A better first step for Khachlan's algorithm in linear programming

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 Q4357799)