Näytetään 1 - 10 yhteensä 16 tuloksesta haulle '"Approximation algorithms."', hakuaika: 0,02s Tarkenna hakua
  1. 1

    Approximate iterative algorithms Tekijä Almudevar, Anthony

    Julkaistu 2014
    Available for University of the Philippines Diliman College of Engineering via CRCnetBASE. Click here to access
    Also available remotely for University of the Philippines Diliman College of Engineering via CRCnetBASE. Click here to access thru EZproxy
    Electronic Resource

    Approximate iterative algorithms
  2. 2

    Approximation algorithms for complex systems proceedings of the 6th international conference on algorithms for approximation, Ambleside, UK, 31st August - 4th September 2009 Tekijä Georgoulis, Emmanuil H.

    Julkaistu 2011
    Available for University of the Philippines Diliman via SpringerLink. Click here to access
    Electronic Resource

    Approximation algorithms for complex systems proceedings of the 6th international conference on algorithms for approximation, Ambleside, UK, 31st August - 4th September 2009
  3. 3

    Local ratio: a unified framework for approximation algorithms. In memoriam Shimon Even 1935-2004. Tekijä Bar-Yehuda, Reuven

    Artikkeli

    Local ratio: a unified framework for approximation algorithms. In memoriam Shimon Even 1935-2004.
  4. 4

    A Survey of Graph Layout Problems. Tekijä Diaz, Josep

    Artikkeli

    A Survey of Graph Layout Problems.
  5. 5

    An approximation result for a duo-processor task scheduling problem. Tekijä Olmo, P. Dell

    Artikkeli

    An approximation result for a duo-processor task scheduling problem.
  6. 6

    On approximating the memory-Constrained Module Allocation Problem. Tekijä Roupin, Frederic

    Artikkeli

    On approximating the memory-Constrained Module Allocation Problem.
  7. 7

    An approximation algorithm for clustering graphs with dominating diametral path. Tekijä Deogun, Jitender S.

    Artikkeli

    An approximation algorithm for clustering graphs with dominating diametral path.
  8. 8

    Coloring k-colorable graphs using relatively small palettes. Tekijä Halperin, Eran

    Artikkeli

    Coloring k-colorable graphs using relatively small palettes.
  9. 9

    Optimal Time Bounds for Approximate Clustering. Tekijä Mettu, Ramgopal R.

    Julkaisussa Machine learning.
    Artikkeli

    Optimal Time Bounds for Approximate Clustering.
  10. 10

    Correlation clustering. Tekijä Bansal, Nikhil

    Julkaisussa Machine learning.
    Artikkeli

    Correlation clustering.

Työkalut: