Výsledky vyhledávání - "Discrete mathematics—Graph algorithms General Terms"

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

Autoři: Sándor P. Fekete Henk Meijer André Rohe a další

Přispěvatelé: Sándor P. Fekete Henk Meijer André Rohe a další

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

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

Popis souboru: application/pdf

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

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

Autoři: Maciej Kurowski The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Maciej Kurowski The Pennsylvania State University CiteSeerX Archives

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

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

Popis souboru: 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

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

Erratum: Approximating Minimum-Cost Connectivity Problems via Uncrossable Bifamilies.

Zdroj: ACM Transactions on Algorithms; Jun2018, Vol. 14 Issue 3, p1-8, 8p

Témata: APPROXIMATION algorithms, GRAPH connectivity, POLYNOMIAL time algorithms

Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights.

Autoři: DINITZ, MICHAEL KORTSARZ, GUY NUTOV, ZEEV

Zdroj: ACM Transactions on Algorithms; Mar2017, Vol. 13 Issue 3, p1-16, 16p

Témata: APPROXIMATION algorithms, GRAPH algorithms, SUBGRAPHS, WEIGHTED graphs, MATHEMATICAL bounds

Faster Symmetry Discovery using Sparsity of Symmetries.

Autoři: Darga, Paul T. Sakallah, Karem A. Markov, Igor L.

Zdroj: DAC: Annual ACM/IEEE Design Automation Conference; 2008, p149-154, 6p, 1 Diagram, 1 Chart

Témata: ROBUST control, ARTIFICIAL intelligence, ELECTRONIC data processing, ALGORITHMS, COMPUTER programming

Regularization of hierarchical VHDL-AMS models using bipartite graphs.

Autoři: Mades, J. Glesner, M.

Zdroj: Proceedings 2002 Design Automation Conference (IEEE Cat. No.02CH37324); 2002, p548-551, 4p

A Simplified 1.5-Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 2.

Autoři: KORTSARZ, GUY NUTOV, ZEEV

Zdroj: ACM Transactions on Algorithms; Nov2015, Vol. 12 Issue 2, p23:1-23:20, 20p

Témata: APPROXIMATION algorithms, MATHEMATICAL optimization, GRAPH connectivity, MATHEMATICAL connectedness, GRAPH theory