Home>Results
Advanced Search
[会议论文]
关于图划分问题的改进的近似算法
Search Tips: In advanced search, multiple fields is performed in order: E.g A OR B AND C equal (A OR B) AND C.
Author:
Abstract:
本文考虑NP-难的极大图划分(MAX-GP)问题。我们给出应用半定规划(SDP)松弛的一个一般方法,并且给出包括极大方向割,稠密子图,极大顶点覆盖,极大割,和极大反割在内的图划分问题的改进的近似比。
Keyword:
Author Community:
Reprint Author's Address:
Email:
Translated Title
Translated Abstract
Translated Keyword
Conference Name
第六届中国青年运筹与管理学者大会
Organizers
Place
Date
2004-07-01
Sponsor
Classification
Type
Project Name
Project No.
Access Number
CNKI:EGYL200407001026
Language
Chinese
Corresponding authors email
Author Info
Related Keywords:
Related Article:
2005,应用数学学报
2016,运筹学学报
2005,中国科学(A辑:数学)
2005,中国科学A辑
Source :
Year: 2004
Language: Chinese
Cited Count:
WoS CC Cited Count: 0
SCOPUS Cited Count:
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 1
Affiliated Colleges:
理学部
Get Fulltext
External Links: