Are there more almost separable partitions than separable partitions? (English)
- New search for: Chang, F. H.
- New search for: Chen, H. B.
- New search for: Hwang, F. K.
- New search for: Chang, F. H.
- New search for: Chen, H. B.
- New search for: Hwang, F. K.
In:
JOURNAL OF COMBINATORIAL OPTIMIZATION
;
27
, 3
;
567-573
;
2014
-
ISSN:
- Article (Journal) / Print
-
Title:Are there more almost separable partitions than separable partitions?
-
Contributors:
-
Published in:JOURNAL OF COMBINATORIAL OPTIMIZATION ; 27, 3 ; 567-573
-
Publisher:
- New search for: Springer Science + Business Media
-
Publication date:2014-01-01
-
Size:7 pages
-
ISSN:
-
Type of media:Article (Journal)
-
Type of material:Print
-
Language:English
- New search for: 511.6
- Further information on Dewey Decimal Classification
-
Classification:
DDC: 511.6 -
Source:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Table of contents – Volume 27, Issue 3
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 417
-
On the performance of Scatter Search for post-enrolment course timetabling problemsJaradat, Ghaith / Ayob, Masri / Ahmad, Zulkifli et al. | 2012
- 440
-
Star list chromatic number of planar subcubic graphsChen, Min / Raspaud, André / Wang, Weifan et al. | 2012
- 451
-
On the total outer-connected domination in graphsFavaron, O. / Karami, H. / Sheikholeslami, S. M. et al. | 2012
- 462
-
Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networksPastukhov, Grigory / Veremyev, Alexander / Boginski, Vladimir / Pasiliao, Eduardo L. et al. | 2012
- 487
-
On the approximability of positive influence dominating set in social networksDinh, Thang N. / Shen, Yilin / Nguyen, Dung T. / Thai, My T. et al. | 2012
- 504
-
An approximation algorithm for k-center problem on a convex polygonDu, Hai / Xu, Yinfeng et al. | 2012
- 519
-
Improved upper bound for acyclic chromatic index of planar graphs without 4-cyclesWang, Yingqian / Sheng, Ping et al. | 2012
- 530
-
The Pfaffian property of Cartesian products of graphsLu, Fuliang / Zhang, Lianzhu et al. | 2012
- 541
-
A simple Byzantine Generals protocolWang, Junxing et al. | 2012
- 545
-
A two-stage approach for surgery schedulingZhong, Liwei / Luo, Shoucheng / Wu, Lidong / Xu, Lin / Yang, Jinghui / Tang, Guochun et al. | 2012
- 557
-
On minimum balanced bipartitions of triangle-free graphsLi, Haiyan / Liang, Yanting / Liu, Muhuo / Xu, Baogang et al. | 2012
- 567
-
Are there more almost separable partitions than separable partitions?Chang, Fei-Huang / Chen, Hong-Bin / Hwang, Frank K. et al. | 2012
- 574
-
Popularity at minimum costKavitha, Telikepalli / Nasre, Meghana / Nimbhorkar, Prajakta et al. | 2012
- 597
-
Order consolidation for hierarchical product linesKwak, Woo-Lahm / Chang, Soo Y. et al. | 2012
- 609
-
A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penaltiesLi, Yu / Du, Donglei / Xiu, Naihua / Xu, Dachuan et al. | 2012