Np-Completeness and Approximation Algorithm for the Maximum Integral Vertex-Balanced Flow Problem

Journal of the Operations Research Society of Japan - Japan
doi 10.15807/jorsj.34.13
Full Text
Abstract

Available in full text

Date
Authors
Publisher

The Operations Research Society of Japan

Related search

Approximation Algorithm for Extended Maximum---- Concurrent Flow Problem With Saturated Capacity

2015English

On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: NP-Completeness and Approximation Algorithm

2008English

A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

On Generic Np-Completeness of the Boolean Satisfiability Problem

Prikladnaya Diskretnaya Matematika
Signal ProcessingCombinatoricsApplied MathematicsMathematicsDiscrete MathematicsComputational TheoryTheoretical Computer Science
2017English

PUSH: A Generalized Operator for the Maximum Vertex Weight Clique Problem

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2017English

Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
2019English

Query Order and NP-completeness

English

An Exact Algorithm for the Capacitated Vertex -Center Problem

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2006English

Erratum: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2002English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy