A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs (English)
- New search for: Wang, W.
- New search for: Huang, D.
- New search for: Wang, Y.
- New search for: Du, D. Z.
- New search for: Wang, W.
- New search for: Huang, D.
- New search for: Wang, Y.
- New search for: Du, D. Z.
In:
JOURNAL OF GLOBAL OPTIMIZATION
;
65
, 2
;
351-367
;
2016
-
ISSN:
- Article (Journal) / Print
-
Title:A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs
-
Contributors:
-
Published in:JOURNAL OF GLOBAL OPTIMIZATION ; 65, 2 ; 351-367
-
Publisher:
- New search for: Springer Science + Business Media
-
Publication date:2016-01-01
-
Size:17 pages
-
ISSN:
-
Type of media:Article (Journal)
-
Type of material:Print
-
Language:English
- New search for: 510
- Further information on Dewey Decimal Classification
-
Classification:
DDC: 510 -
Source:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Table of contents – Volume 65, Issue 2
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.
- 137
-
Irregular polyomino tiling via integer programming with application in phased array antenna designKarademir, Serdar / Prokopyev, Oleg A. / Mailloux, Robert J. et al. | 2015
- 175
-
Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible setsJeyakumar, V. / Kim, S. / Lee, G. M. / Li, G. et al. | 2015
- 191
-
Extended reverse-convex programming: an approximate enumeration approach to global optimizationBunin, Gene A. et al. | 2015
- 231
-
Dynamic programming approximation algorithms for the capacitated lot-sizing problemBüyüktahtakın, İ. Esra / Liu, Ning et al. | 2015
- 261
-
Numerical approximation of the solution in infinite dimensional global optimization using a representation formulaZidani, H. / De Cursi, J. E. Souza / Ellaia, R. et al. | 2015
- 283
-
Quasi-phi-functions and optimal packing of ellipsesStoyan, Y. / Pankratov, A. / Romanova, T. et al. | 2015
- 309
-
Global behavior of the Douglas–Rachford method for a nonconvex feasibility problemAragón Artacho, Francisco J. / Borwein, Jonathan M. / Tam, Matthew K. et al. | 2015
- 329
-
On Slater’s condition and finite convergence of the Douglas–Rachford algorithm for solving convex feasibility problems in Euclidean spacesBauschke, Heinz H. / Dao, Minh N. / Noll, Dominikus / Phan, Hung M. et al. | 2015
- 351
-
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphsWang, Weifan / Huang, Danjun / Wang, Yanwen / Wang, Yiqiao / Du, Ding-Zhu et al. | 2015
- 369
-
Heuristics for exact nonnegative matrix factorizationVandaele, Arnaud / Gillis, Nicolas / Glineur, François / Tuyttens, Daniel et al. | 2015