Suchergebnisse - "Combinatorics—combinatorial complexity General Terms"

  • Treffer 1 - 3 von 3
Treffer weiter einschränken
  1. 1

    A Near-Linear Constant-Factor Approximation for Euclidean Bipartite Matching?

    Autoren: Pankaj K. Agarwal The Pennsylvania State University CiteSeerX Archives

    Weitere Verfasser: Pankaj K. Agarwal The Pennsylvania State University CiteSeerX Archives

    Quelle: http://biogeometry.duke.edu/pubs-pankaj/papers/bipartite.pdf.

    Schlagwörter: and computations, G.2.1 [Discrete Mathematics, Combinatorics—combinatorial complexity General Terms, Theory, Combinatorial Optimization Keywords, Matching, approximation algorithms

    Dateibeschreibung: application/pdf

    Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.72.3542

    Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.72.3542
    http://biogeometry.duke.edu/pubs-pankaj/papers/bipartite.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  2. 2

    A Near-Linear Constant-Factor Approximation for Euclidean Bipartite Matching?

    Autoren: Pankaj K. Agarwal The Pennsylvania State University CiteSeerX Archives

    Weitere Verfasser: Pankaj K. Agarwal The Pennsylvania State University CiteSeerX Archives

    Quelle: http://web.eecs.umich.edu/~pettie/matching/Agarwal-Varadarajan-bichromatic-euclidean-mwpm-approx.pdf.

    Schlagwörter: Categories and Subject Descriptors, F.2.2 [Theory of Computation, Nonnumerical Algorithms and Problems—geometrical problems and computations, G.2.1 [Discrete Mathematics, Combinatorics—combinatorial complexity General Terms, Theory, Combinatorial Optimization Keywords, Matching, approximation algorithms

    Dateibeschreibung: application/pdf

    Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.3783

    Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.3783
    http://web.eecs.umich.edu/~pettie/matching/Agarwal-Varadarajan-bichromatic-euclidean-mwpm-approx.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  3. 3

    A Near-Linear Constant-Factor Approximation for Euclidean Bipartite Matching?

    Autoren: Pankaj K. Agarwal The Pennsylvania State University CiteSeerX Archives

    Weitere Verfasser: Pankaj K. Agarwal The Pennsylvania State University CiteSeerX Archives

    Quelle: http://www.cs.uiowa.edu/~kvaradar/paps/p079-agarwal.pdf.

    Schlagwörter: and computations, G.2.1 [Discrete Mathematics, Combinatorics—combinatorial complexity General Terms, Theory, Combinatorial Optimization Keywords, Matching, approximation algorithms

    Dateibeschreibung: application/pdf

    Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.114.1879

    Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.114.1879
    http://www.cs.uiowa.edu/~kvaradar/paps/p079-agarwal.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten

Suchwerkzeuge: