Approximation algorithms for some graph partitioning problems.

He, G.; Liu, J.; Zhao, C.

Displaying similar documents to “Approximation algorithms for some graph partitioning problems.”

On-Line Computation and Maximum-Weighted Hereditary Subgraph Problems

Marc Demange, Bernard Kouakou, Eric Soutif (2011)

The Yugoslav Journal of Operations Research

Similarity:

A factor-two approximation algorithm for two-dimensional phase unwrapping.

Bar-Yehuda, Reuven, Yavneh, Irad (2006)

Journal of Graph Algorithms and Applications

Similarity:

Two heuristics for the absolute $p$ -center problem in graphs

Ján Plesník (1988)

Mathematica Slovaca

Similarity:

On-line models and algorithms for max independent set

Bruno Escoffier, Vangelis Th. Paschos (2006)

RAIRO - Operations Research

Similarity:

In on-line computation, the instance of the problem dealt is not entirely known from the beginning of the solution process, but it is revealed step-by-step. In this paper we deal with on-line independent set. On-line models studied until now for this problem suppose that the input graph is initially empty and revealed either vertex-by-vertex, or cluster-by-cluster. Here we present a new on-line model quite different to the ones already studied. It assumes that a superset of the final...