Approximate Max K-Cut With Subgraph Guarantee

Information Processing Letters - Netherlands
doi 10.1016/s0020-0190(98)00005-2
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

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

1989English

A Branch-And-Cut Algorithm for the Maximum K-Balanced Subgraph of a Signed Graph

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

On Speeding Up Frequent Approximate Subgraph Mining

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Distributed Approximate K-Core Decomposition and Min-Max Edge Orientation: Breaking the Diameter Barrier

2019English

Max Cut for Random Graphs With a Planted Partition

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
2004English

Semantic Ontology Method of Learning Resource Based on the Approximate Subgraph Isomorphism

Journal of Multimedia
2014English

Minimally Strong Subgraph (K,l)-Arc-Connected Digraphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2020English

PTAS for Densest K-Subgraph in Interval Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Advanced Scatter Search for the Max-Cut Problem

INFORMS Journal on Computing
Management ScienceComputer Science ApplicationsInformation SystemsOperations ResearchSoftware
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy