scientific article; zbMATH DE number 7204984

DOI10.4230/LIPICS.ESA.2017.6zbMATH Open1442.68158MaRDI QIDQ5111689FDOQ5111689

Hassene Aissi, A. R. Mahjoub, R. Ravi

Publication date: 27 May 2020

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

zbMATH Keywords

randomized algorithmsgraph algorithmsmultiobjective optimizationminimum cutbudget constraints

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Introduction to algorithms
• Multicriteria optimization
• Minimizing symmetric submodular functions
• Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
• Unbalanced Graph Partitioning
• A new approach to the minimum cut problem
• Computing All Small Cuts in an Undirected Network
• An efficient algorithm for the minimum capacity cut problem
• A simple min-cut algorithm
• Multicriteria global minimum cuts
• Algorithms – ESA 2005
• Connectivity interdiction
• Cardinality constrained minimum cut problems: complexity and algorithms.
• A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem
• Algorithms for symmetric submodular function minimization under hereditary constraints and generalizations

Cited In (2)

• Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs.
• Multicriteria cuts and size-constrained \(k\)-cuts in hypergraphs

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