Approximation algorithms for [TEX equation: k] -partitioning problems with partition matroid constraint

ISSN： 1862-4472

Source： Optimization Letters, Vol.8, Iss.3, 2014-03, pp. : 1093-1099

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Approximation Algorithms for Maximization Problems Arising in Graph Partitioning

By Feige U. Langberg M.

Journal of Algorithms, Vol. 41, Iss. 2, 2001-11 ,pp. : 174-211

Elsevier

Access to resources Recommend Favorite

[TEX equation: ell ] -Adic properties of partition functions

By Belmont Eva Lee Holden Musat Alexandra Trebat-Leder Sarah

Monatshefte für Mathematik, Vol. 173, Iss. 1, 2014-01 ,pp. : 1-34

Springer Publishing Company

Access to resources Recommend Favorite

Description of ρ(1700) as a [TEX equation: rho Kbar K] system with the fixed-center approximation

By Bayar M. Liang W. Uchino T. Xiao C.

The European Physical Journal A - Hadrons and Nuclei, Vol. 50, Iss. 4, 2014-04 ,pp. : 1-10

Springer Publishing Company

Access to resources Recommend Favorite

Approximation Algorithms for Min-Max Tree Partition

By Guttmann-Beck N. Hassin R.

Journal of Algorithms, Vol. 24, Iss. 2, 1997-08 ,pp. : 266-286

Academic Press

Access to resources Recommend Favorite

Approximation by Complex [TEX equation: q] -Szász–Kantorovich Operators in Compact Disks, [TEX equation: q>1]

By Gal Sorin Mahmudov Nazim Kara Mustafa

Complex Analysis and Operator Theory, Vol. 7, Iss. 6, 2013-12 ,pp. : 1853-1867

Springer Publishing Company

Access to resources Recommend Favorite