Towards Fast Decentralized Construction of Locality-Aware Overlay Networks

Authors: Aleksandrs Slivkins

Contributors: The Pennsylvania State University CiteSeerX Archives

Source: http://research.microsoft.com/users/slivkins/podc07_full.pdf.

Subject Terms: ACM Categories and Subject Descriptors. E.1 [Data Structures, Distributed data structures, Graphs and networks, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems – Computations on discrete structures, Routing and layout, G.2 [Discrete Mathematics, G.2.1 Combinatorics – Combinatorial algorithms, G.2.2 Graph Theory – Graph algorithms, Graph labeling, Network problems. C.2.2 [Computer- Communication Networks, Network Protocols – Routing protocols. ACM General Terms. Algorithms, Performance, Theory Keywords. Routing schemes, multi-cast trees, distance labeling, triangulation, grid dimension, growthconstrained metrics, locality-awareness

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.1460; http://research.microsoft.com/users/slivkins/podc07_full.pdf

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.1460
http://research.microsoft.com/users/slivkins/podc07_full.pdf

Dynamic Programming Algorithms for Haplotype Block Partitioning: Applications to Human Chromosome 21 Haplotype Data

Authors: Kui Zhang, Fengzhu Sun, Michael S. Waterman, Ting Chen

Contributors: The Pennsylvania State University CiteSeerX Archives

Source: http://www-hto.usc.edu/~fsun/Publication/SNP/p172-zhang.pdf.

Subject Terms: Optimization. G.2.1 [Combinatorics] Combinatorial Algorithms

File Description: application/pdf

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

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.1172
http://www-hto.usc.edu/~fsun/Publication/SNP/p172-zhang.pdf

Artificial Intelligence Methods and Techniques for Business and Engineering Applications 148 ARTIFICIAL INTELLIGENCE IN MODELING AND SIMULATION DECOMPOSITION METHODS FOR LARGE-SCALE TSP

Authors: Roman Bazylevych, Marek Pałasiński, Roman Kutelmakh, Bohdan Kuz, Lubov Bazylevych

Contributors: The Pennsylvania State University CiteSeerX Archives

Source: http://www.foibg.com/ibs_isc/ibs-26/ibs-26-p10.pdf.

Subject Terms: traveling salesman problem, combinatorial NP-hard problems, decomposition, large-scale. ACM Classification Keywords, G.2.1 Combinatorics- Combinatorial algorithms, I.2.8 Problem Solving, Control Methods, and Search- Heuristic methods

File Description: application/pdf

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

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.387.919
http://www.foibg.com/ibs_isc/ibs-26/ibs-26-p10.pdf

ON THE DISCRETIZATION OF DISTANCE GEOMETRY PROBLEMS

Authors: Antonio Mucherino, Carlile Lavor, Leo Liberti, Nelson Maculan

Contributors: The Pennsylvania State University CiteSeerX Archives

Source: http://www.foibg.com/ibs_isc/ibs-25/ibs-25-p16.pdf.

Subject Terms: distance geometry, discretization, combinatorial optimization, discretizing orderings, symmetries. ACMClassification Keywords, G.2.1 Combinatorics- Combinatorial algorithms, B.5.2 Design Aids- Optimization, J.3 Life and Medical Sciences- Biology and genetics

File Description: application/pdf

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

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.306.9267
http://www.foibg.com/ibs_isc/ibs-25/ibs-25-p16.pdf