Search Results - "Discrete mathematics—Graph algorithms General Terms"

Solving a 'Hard' Problem to Approximate an 'Easy' one: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems

Authors: Sándor P. Fekete Henk Meijer André Rohe et al.

Contributors: Sándor P. Fekete Henk Meijer André Rohe et al.

Source: http://arxiv.org/pdf/cs/0212044v1.pdf.

Subject Terms: Geometrical problems and computations, G.2.2 [Mathematics of Computing, Discrete mathematics—Graph algorithms General Terms, Approximation, heuristics, geometric optimization Additional Key Words and Phrases, geometric problems, Fermat-Weber problem, maximum Traveling Salesman Problem (MTSP, maximum weighted matching, near-linear algorithms

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.341.8347; http://arxiv.org/pdf/cs/0212044v1.pdf

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.341.8347
http://arxiv.org/pdf/cs/0212044v1.pdf

Oracles for bounded length shortest paths in planar graphs

Authors: Maciej Kurowski The Pennsylvania State University CiteSeerX Archives

Contributors: Maciej Kurowski The Pennsylvania State University CiteSeerX Archives

Source: http://www.mimuw.edu.pl/~kowalik/papers/oracle.pdf.

Subject Terms: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures, G.2.2 [Mathematics of Computing, Discrete Mathematics—Graph Algorithms General Terms, Algorithms, Theory Additional Key Words and Phrases, Bounded length, dynamic environment, oracle, planar graph, shortest

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.7574; http://www.mimuw.edu.pl/~kowalik/papers/oracle.pdf

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.7574
http://www.mimuw.edu.pl/~kowalik/papers/oracle.pdf