Approximating

ISSN： 0001-9054

Source： aequationes mathematicae, Vol.75, Iss.1-2, 2008-03, pp. : 93-102

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

Abstract

Related content

Approximating the chromatic index of multigraphs

By Chen Guantao Yu Xingxing Zang Wenan

Journal of Combinatorial Optimization, Vol. 21, Iss. 2, 2011-02 ,pp. : 219-246

Springer Publishing Company

Access to resources Recommend Favorite

Approximating Clique and Biclique Problems

By Hochbaum D.S.

Journal of Algorithms, Vol. 29, Iss. 1, 1998-10 ,pp. : 174-200

Academic Press

Access to resources Recommend Favorite

Approximating capacitated tree-routings in networks

By Morsy Ehab Nagamochi Hiroshi

Journal of Combinatorial Optimization, Vol. 21, Iss. 2, 2011-02 ,pp. : 254-267

Springer Publishing Company

Access to resources Recommend Favorite

On the Hardness of Approximating the Min-Hack Problem

By Chinchani Ramkumar Ha Duc Iyer Anusha Ngo Hung Upadhyaya Shambhu

Journal of Combinatorial Optimization, Vol. 9, Iss. 3, 2005-05 ,pp. : 295-311

Springer Publishing Company

Access to resources Recommend Favorite

On approximating the distribution of indefinite quadratic forms

By Provost Serge

Statistics, Vol. 43, Iss. 6, 2009-12 ,pp. : 597-609

Taylor & Francis Ltd

Access to resources Recommend Favorite