scispace - formally typeset
Journal ArticleDOI

Handbook of Approximation: Algorithms and Metaheuristics

C.J.H. Mann
- 15 Feb 2008 - 
- Vol. 37, Iss: 2
About
This article is published in Kybernetes.The article was published on 2008-02-15. It has received 164 citations till now. The article focuses on the topics: Approximation algorithm & Metaheuristic.

read more

Citations
More filters
Journal ArticleDOI

Zero Duality Gap in Optimal Power Flow Problem

TL;DR: In this article, a necessary and sufficient condition is provided to guarantee the existence of no duality gap for the optimal power flow problem, which is the dual of an equivalent form of the OPF problem.
Journal ArticleDOI

Distributed Verification and Hardness of Distributed Approximation

TL;DR: The verification problem in distributed networks is studied, stated as follows: let H be a subgraph of a network G where each vertex of G knows which edges incident on it are in H.
Journal ArticleDOI

A Survey on Vertex Coloring Problems

TL;DR: The classical models for the classical VCP are introduced, and how these models can be used and possibly strengthened to derive exact and heuristic algorithms for the problem are discussed.
Journal ArticleDOI

Improving the performance of k-means for color quantization

TL;DR: Experiments demonstrate that an efficient implementation of k-means with an appropriate initialization strategy can in fact serve as a very effective color quantizer.
Journal ArticleDOI

Exact algorithms for the two-dimensional strip packing problem with and without rotations

TL;DR: In this paper, exact algorithms for the 2D strip packing problem with and without 90° rotations were proposed. But these algorithms were not tailored for problems without rotations, such as the perfect packing problem.
References
More filters
Journal ArticleDOI

Zero Duality Gap in Optimal Power Flow Problem

TL;DR: In this article, a necessary and sufficient condition is provided to guarantee the existence of no duality gap for the optimal power flow problem, which is the dual of an equivalent form of the OPF problem.
Journal ArticleDOI

Distributed Verification and Hardness of Distributed Approximation

TL;DR: The verification problem in distributed networks is studied, stated as follows: let H be a subgraph of a network G where each vertex of G knows which edges incident on it are in H.
Journal ArticleDOI

A Survey on Vertex Coloring Problems

TL;DR: The classical models for the classical VCP are introduced, and how these models can be used and possibly strengthened to derive exact and heuristic algorithms for the problem are discussed.
Journal ArticleDOI

Improving the performance of k-means for color quantization

TL;DR: Experiments demonstrate that an efficient implementation of k-means with an appropriate initialization strategy can in fact serve as a very effective color quantizer.
Journal ArticleDOI

Exact algorithms for the two-dimensional strip packing problem with and without rotations

TL;DR: In this paper, exact algorithms for the 2D strip packing problem with and without 90° rotations were proposed. But these algorithms were not tailored for problems without rotations, such as the perfect packing problem.