Výsledky vyhledávání - "polynomial time approximation algorithm"

A Polynomial-Time Approximation Algorithm for Complete Interval Minors

Autoři: Bourneuf, Romain Cocquet, Julien Tang, Chaoliang a další

Přispěvatelé: Bourneuf, Romain Cocquet, Julien Tang, Chaoliang a další

Témata: FOS: Computer and information sciences, Delayed decompositions, Ordered graphs, Discrete Mathematics (cs.DM), Interval minors, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, Approximation algorithm, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2505.05997
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2025.15

Polynomial Time Approximation Algorithm for Supremum of Sub-Exponential Processes

Zdroj: Pure Mathematics. 14:105-111

A strongly polynomial time approximation algorithm for the min-max clustered cycle cover problem

Autoři: Pengxiang Pan Hongtao Zhu

Zdroj: Theoretical Computer Science. 1029:115050

A simple polynomial-time approximation algorithm for the total variation distance between two product distributions

Autoři: Feng, Weiming Guo, Heng Jerrum, Mark a další

Zdroj: Symposium on Simplicity in Algorithms (SOSA) ISBN: 9781611977585
TheoretiCS, Vol Volume 2 (2023)
Feng, W, Guo, H, Jerrum, M & Wang, J 2023, ' A simple polynomial-time approximation algorithm for the total variation distance between two product distributions ', TheoretiCS, vol. 2, 8, pp. 1-7 . https://doi.org/10.46298/theoretics.23.7
TheoretiCS
2023 Symposium on Simplicity in Algorithms (SOSA)
Symposium on Simplicity in Algorithms (SOSA)

Témata: FOS: Computer and information sciences, total variation distance, f.2.0, g.3, G.3, 68w20, F.2.0, QA75.5-76.95, 0102 computer and information sciences, 68W20, product distribution, 01 natural sciences, computer science - data structures and algorithms, Methodology (stat.ME), Electronic computers. Computer science, statistics - methodology, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), approximation algorithm, Statistics - Methodology

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2208.00740
https://theoretics.episciences.org/10534
https://doi.org/10.46298/theoretics.23.7
https://doaj.org/article/8d75bcff5dce43258cf965b28c393697
https://hdl.handle.net/20.500.11820/ec699ef7-b580-45b5-992a-12e6ca5322b4
https://www.pure.ed.ac.uk/ws/files/356660619/A_simple_polynomial_FENG_DOA15052023_VOR_CC_BY.pdf

A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability

Autoři: Guo, Heng Jerrum, Mark Heng Guo and Mark Jerrum a další

Přispěvatelé: Guo, Heng Jerrum, Mark Heng Guo and Mark Jerrum a další

Zdroj: Guo, H & Jerrum, M 2019, ' A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability ', SIAM Journal on Computing, vol. 48, no. 3, pp. 964–978 . https://doi.org/10.1137/18M1201846
Guo, H & Jerrum, M 2018, A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability . in I Chatzigiannakis, C Kaklamanis, D Marx & D Sannella (eds), 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) . vol. 107, Leibniz International Proceedings in Informatics (LIPIcs), vol. 107, Dagstuhl, Germany, pp. 68:1-68:12, 45th International Colloquium on Automata, Languages, and Programming, Prague, Czech Republic, 9/07/18 . https://doi.org/10.4230/LIPIcs.ICALP.2018.68

Témata: FOS: Computer and information sciences, Markov chains, randomized algorithms, 0102 computer and information sciences, 01 natural sciences, Approximate counting, Computer Science - Data Structures and Algorithms, network reliability, Data Structures and Algorithms (cs.DS), ddc:004, Network Reliability, Sampling, approximate counting

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2018/9072/pdf/LIPIcs-ICALP-2018-68.pdf
http://arxiv.org/abs/1709.08561
https://qmro.qmul.ac.uk/xmlui/handle/123456789/57919
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp48.html#GuoJ19
https://epubs.siam.org/doi/pdf/10.1137/18M1201846
https://ui.adsabs.harvard.edu/abs/2017arXiv170908561G/abstract
https://arxiv.org/abs/1709.08561
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.68
https://hdl.handle.net/20.500.11820/38d3d827-0dbc-4a34-8c02-75d492d388d2
https://www.pure.ed.ac.uk/ws/files/79635690/Cluster.Popping_SICOMP_final.pdf
https://www.pure.ed.ac.uk/ws/files/82532416/A_Polynomial_Time_Approximation_ICALP_GUO_DoA150418_VoR_CC_BY.pdf
https://hdl.handle.net/20.500.11820/c2b4e5cc-2022-4b12-9ab5-42c55f8f0d51

FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM

Autoři: Ksenia Rizhenko Katherine Neznakhina Michael Khachay

Zdroj: Ural Mathematical Journal, Vol 9, Iss 1 (2023)

Témata: prize-collecting traveling salesman problem, triangle inequality, approximation algorithm, fixed approximation ratio., Mathematics, QA1-939

Popis souboru: electronic resource

Relation: https://umjuran.ru/index.php/umj/article/view/648; https://doaj.org/toc/2414-3952

Přístupová URL adresa: https://doaj.org/article/2345846251fb4893bcfbe1c2a0dda240

A simple polynomial-time approximation algorithm for the total variation distance between two product distributions

Autoři: Feng, Weiming Guo, Heng Jerrum, Mark a další

Témata: Computer Science - Data Structures and Algorithms, Statistics - Methodology, 68W20, F.2.0, G.3, text

URL: http://arxiv.org/abs/2208.00740

A Flow-Network-Based Polynomial-Time Approximation Algorithm for the Minimum Constrained Input Structural Controllability Problem

Autoři: Shana Moothedath Prasanna Chaporkar Madhu N. Belur

Zdroj: IEEE Transactions on Automatic Control. 63:3151-3158

Témata: 0209 industrial biotechnology, 0203 mechanical engineering, SYSTEMS, maximum flow problem, minimum input structural controllability, structural controllability, 02 engineering and technology, minimum-cost fixed-flow (MCFF) problem, Approximation algorithms

Přístupová URL adresa: https://ieeexplore.ieee.org/document/8267200
https://dblp.uni-trier.de/db/journals/tac/tac63.html#MoothedathCB18
https://doi.org/10.1109/TAC.2018.2797210

A Polynomial-Time Approximation Algorithm for One Problem Simulating the Search in a Time Series for the Largest Subsequence of Similar Elements

Autoři: Alexander Kel'manov Yu. V. Shamardin S. A. Khamidullin a další

Zdroj: Pattern Recognition and Image Analysis. 28:363-370

Témata: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Přístupová URL adresa: https://link.springer.com/article/10.1134%2FS1054661818030094
https://link.springer.com/content/pdf/10.1134/S1054661818030094.pdf

Polynomial-Time Approximation Algorithm for the Problem of Cardinality-Weighted Variance-Based 2-Clustering with a Given Center

Autoři: A. V. Motkova Alexander Kel'manov

Zdroj: Computational Mathematics and Mathematical Physics. 58:130-136

Témata: 0102 computer and information sciences, 0101 mathematics, 01 natural sciences

Přístupová URL adresa: https://inis.iaea.org/Search/search.aspx?orig_q=RN:50039774
https://link.springer.com/article/10.1134/S0965542518010074
https://ui.adsabs.harvard.edu/abs/2018CMMPh..58..130K/abstract

A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem

Autoři: Ye, Yinyu

Zdroj: Mathematics of Operations Research, 1993 May 01. 18(2), 334-345.

Přístupová URL adresa: https://www.jstor.org/stable/3690284

Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks

Autoři: M. Bouznif R. Giroudeau Optimisation Combinatoire (G-SCOP_OC) a další

Přispěvatelé: M. Bouznif R. Giroudeau Optimisation Combinatoire (G-SCOP_OC) a další

Zdroj: Advances in Operations Research. 2011:1-20

Témata: [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Popis souboru: text/xhtml

Přístupová URL adresa: http://downloads.hindawi.com/journals/aor/2011/476939.pdf

A Polynomial-Time Approximation Algorithm for Weighted Sum-Rate Maximization in UWB Networks

Autoři: Rohit Negi Qiao Li Gyouhwan Kim

Zdroj: 2008 IEEE International Conference on Communications. :3775-3779

Témata: 0209 industrial biotechnology, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Přístupová URL adresa: http://dblp.uni-trier.de/db/conf/icc/icc2008.html#KimLN08
https://dblp.uni-trier.de/db/conf/icc/icc2008.html#KimLN08
https://ieeexplore.ieee.org/document/4533745/
http://users.ece.cmu.edu/~negi/publications/preprints/ptas.pdf
http://ieeexplore.ieee.org/document/4533745/

A polynomial time approximation algorithm for the two-commodity splittable flow problem

Autoři: Eisenschmidt, Elke Haus, Utz-Uwe

Zdroj: Mathematical Methods of Operations Research, 77 (3)

Témata: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Computer Science - Discrete Mathematics

Popis souboru: application/application/pdf

Přístupová URL adresa: https://www.research-collection.ethz.ch/bitstream/20.500.11850/57214/2/186_2012_Article_402.pdf
http://arxiv.org/abs/1105.5979
http://hdl.handle.net/20.500.11850/57214
http://doc.rero.ch/record/309866/files/186_2012_Article_402.pdf

A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM

Autoři: Marc Benkert Joachim Gudmundsson Alexander Wolff a další

Zdroj: International Journal of Computational Geometry & Applications. 19:267-288

Témata: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: https://publikationen.bibliothek.kit.edu/1000005162/755932

A polynomial-time approximation algorithm for joint probabilistic data association

Autoři: S. Shankar Sastry Songhwai Oh

Zdroj: Proceedings of the 2005, American Control Conference, 2005.. :1283-1288

Témata: 0209 industrial biotechnology, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Přístupová URL adresa: https://ieeexplore.ieee.org/document/1470141/
http://robotics.eecs.berkeley.edu/~sastry/pubs/PDFs%20of%20Pubs2000-2005/Publications%20of%20Grad%20Students%2020042005/Oh
%20Songhwai/OhSastryPolynomial.pdf
http://www.nt.ntnu.no/users/skoge/prost/proceedings/acc05/PDFs/Papers/0233_WeC04_5.pdf
http://cpslab.snu.ac.kr/publications/papers/10.1.1.132.4589.pdf

A polynomial-time approximation algorithm for counting words accepted by an NFA (invited paper)

Autoři: Rajesh Jayaram Marcelo Arenas Luis Alberto Croquevielle a další

Zdroj: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. :4-4

Témata: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: https://dl.acm.org/doi/pdf/10.1145/3406325.3465353
https://dblp.uni-trier.de/db/conf/stoc/stoc2021.html#ArenasCJR21

A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem: A fully polynomial-time approximation algorithm for computing a stationary point of the general linear complementarity problem

Autoři: YeYinyu

Zdroj: Mathematics of Operations Research. 18:334-345

Témata: polynomal-time algorithm, potential reduction algorithm, Computational methods for problems pertaining to operations research and mathematical programming, polynomial-time approximation scheme, 0211 other engineering and technologies, 02 engineering and technology, Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming), linear complementarity, \(\varepsilon\)-approximate stationary point

Popis souboru: application/xml

Přístupová URL adresa: https://dl.acm.org/doi/10.5555/2773155.2773162

A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries

Autoři: Alistair Sinclair Eric Vigoda Mark Jerrum

Zdroj: Proceedings of the thirty-third annual ACM symposium on Theory of computing. :712-721

Témata: 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, 7. Clean energy

Přístupová URL adresa: https://core.ac.uk/display/21351799
https://dl.acm.org/citation.cfm?id=380877
https://dblp.uni-trier.de/db/conf/stoc/stoc2001.html#JerrumSV01

A polynomial time approximation algorithm for the two-commodity splittable flow problem

Autoři: Eisenschmidt, Elke Haus, Utz-Uwe

URL: http://doc.rero.ch/record/309866/files/186_2012_Article_402.pdf