The Conference on Web Based Business Management (WBM 2010 E-BOOK)

Chengdu,China,9.20-9.22,2010

ISBN: 978-1-935068-18-1 Scientific Research Publishing, USA

E-Book 1342pp Pub. Date: October 2010

Category: Engineering

Price: $80

Title: Congestion Division Problem in a Trees of Rings
Source: The Conference on Web Based Business Management (WBM 2010 E-BOOK) (pp 1147-1150)
Author(s): Qi Wang, School of mathematics & statistic, Hebei University of Economics & Business, Shijiazhuang, China
Xiaoshan Liu, School of mathematics & phisics, Shijiazhuang University of Economics, Shijiazhuang, China
Abstract: Given a hypergraph H on a trees of rings G , the problem of Embedding Hypergraph in a Trees of Rings(EHTR) is to embed each hyperedge of H as a tree in G such that maximal times that these trees using any edge of G is minimal. This problem is initiated from the problem of Minimum-Congestion Hypergraph Embedding in a Cyle(MCHEC). The EHTR problem can be solved as a PTAS by the abbreviative algorithm of the MCHEC problem, and can be proved that it is NP-complete.
Free SCIRP Newsletters
Copyright © 2006-2024 Scientific Research Publishing Inc. All Rights Reserved.
Top