Cargando…
On Approximability of Minimum Bisection and Related Partition Problems
Autor principal: | Karpinski, M |
---|---|
Lenguaje: | eng |
Publicado: |
2003
|
Materias: | |
Acceso en línea: | http://cds.cern.ch/record/630826 |
Ejemplares similares
-
Approximation Schemes for Metric Minimum Bisection and Partitioning
por: Fernández de la Vega, W, et al.
Publicado: (2003) -
Complexity and approximation: combinatorial optimization problems and their approximability properties
por: Ausiello, G
Publicado: (1999) -
On the approximability of the fixed-tree balanced minimum evolution problem
por: Frohn, Martin
Publicado: (2021) -
An Integer Programming Formulation of the Minimum Common String Partition Problem
por: Ferdous, S. M., et al.
Publicado: (2015) -
Bisecting or Not Bisecting: This Is the Neglect Question. Line Bisection Performance in the Diagnosis of Neglect in Right Brain-Damaged Patients
por: Guariglia, Paola, et al.
Publicado: (2014)