Titlebook: WALCOM: Algorithms and Computation; 4th International Wo Md. Saidur Rahman,Satoshi Fujita Conference proceedings 2010 Springer-Verlag Berli

极大的痛苦

Crossings between Curves with Many Tangenciesove every curve in . and that there are . pairs of curves, one from . and the other from ., that are tangent to each other. Then the number of proper crossings among the members of . is at least (1/2 − .(1)). ln .. This bound is almost tight.

组装

AFFIX

A Rooted-Forest Partition with Uniform Vertex Demandts no cycle consisting of non-loop edges. In this paper, we shall study on a partition of a graph into edge-disjoint rooted-forests such that each vertex is spanned by exactly . components of the partition, where . is a positive integer.

胰岛素

A Rooted-Forest Partition with Uniform Vertex Demandts no cycle consisting of non-loop edges. In this paper, we shall study on a partition of a graph into edge-disjoint rooted-forests such that each vertex is spanned by exactly . components of the partition, where . is a positive integer.

领先

Approximation Algorithms for Art Gallery Problems in Polygons and TerrainsIn this survey paper, we present an overview of approximation algorithms that are designed for art gallery problems in polygons and terrains.

Urea508

Approximation Algorithms for Art Gallery Problems in Polygons and TerrainsIn this survey paper, we present an overview of approximation algorithms that are designed for art gallery problems in polygons and terrains.

智力高

向外才掩饰

Cutting a Convex Polyhedron Out of a SphereGiven a convex polyhedron . of . vertices inside a sphere ., we give an .(..)-time algorithm that cuts . out of . by using guillotine cuts and has cutting cost .(log..) times the optimal.

Melanoma

The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in ,(,log,) TimeWe improve the running time from .(..) to .(.log.) of the existing best known 1.375−approximation algorithm for sorting by transpositions with the help of the permutation tree data structure.

扔掉掐死你