Polynomial Flow-Cut Gaps and Hardness of Directed Cut Problems

doi 10.1145/1250790.1250817
Full Text
Abstract

Available in full text

Date
Authors
Publisher

ACM Press

Related search

Flow-Cut Gaps and Face Covers in Planar Graphs

2019English

Approximation Algorithms and Hardness of Thek-Route Cut Problem

ACM Transactions on Algorithms
Mathematics
2016English

Sampling Sub-Problems of Heterogeneous Max-Cut Problems and Approximation Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

To Cut or Not to Cut …

British Journal of General Practice
MedicineFamily Practice
2010English

Commentary: Measure Twice, Cut as Directed. Transit-Time Flow Measurement and High Frequency Ultrasound Guided Surgical Revision

Journal of Thoracic and Cardiovascular Surgery
Respiratory MedicinePulmonaryCardiovascular MedicineSurgeryCardiology
2020English

Optimization of Hot Melt Extrusion Parameters for Sphericity and Hardness of Polymeric Face-Cut Pellets

Drug Development and Industrial Pharmacy
Organic ChemistryDrug DiscoveryPharmacologyPharmaceutical Science
2016English

An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems With Applications to Approximation Algorithms

1989English

Improving the Smoothed Complexity of FLIP for Max Cut Problems

2019English

Cut-And-Paste Knowledge

Nature
Multidisciplinary
2001English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy