Výsledky vyhledávání - "Combinatorics—combinatorial complexity General Terms"

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

Autoři: Pankaj K. Agarwal The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Pankaj K. Agarwal The Pennsylvania State University CiteSeerX Archives

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

Témata: and computations, G.2.1 [Discrete Mathematics, Combinatorics—combinatorial complexity General Terms, Theory, Combinatorial Optimization Keywords, Matching, approximation algorithms

Popis souboru: application/pdf

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

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

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

Autoři: Pankaj K. Agarwal The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Pankaj K. Agarwal The Pennsylvania State University CiteSeerX Archives

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

Témata: 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

Popis souboru: application/pdf

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

Dostupnost: 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

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

Autoři: Pankaj K. Agarwal The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Pankaj K. Agarwal The Pennsylvania State University CiteSeerX Archives

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

Témata: and computations, G.2.1 [Discrete Mathematics, Combinatorics—combinatorial complexity General Terms, Theory, Combinatorial Optimization Keywords, Matching, approximation algorithms

Popis souboru: application/pdf

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

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