Výsledky vyhledávání - "Polynomial time approximation algorithms"

Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs

Autoři: Dyer, M Heinrich, M Jerrum, M a další

Zdroj: Combinatorics, Probability and Computing. 30:905-921

Témata: FOS: Computer and information sciences, Computer Science - Computational Complexity, 4. Education, Computer Science - Data Structures and Algorithms, Probability (math.PR), FOS: Mathematics, Data Structures and Algorithms (cs.DS), 68Q25 (Primary) 68Q17, 68Q87, 82B20 (Secondary), 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Mathematics - Probability

Popis souboru: application/pdf

Přístupová URL adresa: https://eprints.whiterose.ac.uk/162602/1/2005.07944.pdf
http://arxiv.org/abs/2005.07944
https://dblp.uni-trier.de/db/journals/corr/corr2005.html#abs-2005-07944

(1 + ϵ)2-and Polynomial-Time Approximation Algorithms for Network Lifetime Maximization With Relay Hop Bounded Connected Target Coverage in WSNs

Autoři: Phi Le Nguyen Yusheng Ji Minh Khiem Pham a další

Zdroj: IEEE Sensors Journal. 21:9577-9599

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

Přístupová URL adresa: https://ui.adsabs.harvard.edu/abs/2021ISenJ..21.9577L/abstract
https://ieeexplore.ieee.org/document/9328348/

Polynomial-time approximation algorithms for the ising model: Polynomial-time approximation algorithms for the Ising model

Autoři: Alistair Sinclair Mark Jerrum

Zdroj: Lecture Notes in Computer Science ISBN: 3540528261

Témata: partition function, Analysis of algorithms and problem complexity, 4. Education, Markov chain, Ising spin configurations, Interacting random processes, statistical mechanics type models, percolation theory, Numerical methods in equilibrium statistical mechanics, ferromagnetic Ising system, 0102 computer and information sciences, Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics, 01 natural sciences, 7. Clean energy, Markov chains (discrete-time Markov processes on discrete state spaces), Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.), Stochastic methods applied to problems in equilibrium statistical mechanics, Graph algorithms (graph-theoretic aspects), rapid mixing, Ising model, Parallel algorithms in computer science, 0101 mathematics, polynomial-time approximation algorithms, Monte Carlo simulation

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/446912
https://doi.org/10.1137/0222066
https://rd.springer.com/chapter/10.1007/BFb0032051
https://link.springer.com/chapter/10.1007%2FBFb0032051

Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials

Autoři: Patel, V. Regts, G.

Zdroj: SIAM Journal on Computing. 46:1893-1919

Témata: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 0102 computer and information sciences, Computational Complexity (cs.CC), 16. Peace & justice, 01 natural sciences, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), Computer Science - Discrete Mathematics

Přístupová URL adresa: http://arxiv.org/pdf/1607.01167
http://arxiv.org/abs/1607.01167
https://hdl.handle.net/11245.1/73e095ec-91b9-486d-8b98-1df98fb2c490
https://dare.uva.nl/personal/pure/en/publications/deterministic-polynomialtime-approximation-algorithms-for-partition-functions-and-graph-polynomials(73e095ec-91b9-486d-8b98-1df98fb2c490).html
https://doi.org/10.1137/16M1101003
https://hdl.handle.net/11245.1/fe01733d-216e-4bb1-acf4-2c0442b2bd35
https://dare.uva.nl/personal/pure/en/publications/deterministic-polynomialtime-approximation-algorithms-for-partition-functions-and-graph-polynomials(fe01733d-216e-4bb1-acf4-2c0442b2bd35).html
https://doi.org/10.1016/j.endm.2017.07.061
https://arxiv.org/pdf/1607.01167.pdf
https://128.84.21.199/abs/1607.01167?context=math
http://ui.adsabs.harvard.edu/abs/2016arXiv160701167P/abstract
https://arxiv.org/abs/1607.01167v3
https://core.ac.uk/display/160152426
https://www.sciencedirect.com/science/article/abs/pii/S1571065317302263
https://doi.org/10.1016/j.endm.2017.07.061
https://www.narcis.nl/publication/RecordID/oai%3Adare.uva.nl%3Apublications%2Ffe01733d-216e-4bb1-acf4-2c0442b2bd35
https://www.narcis.nl/publication/RecordID/oai%3Adare.uva.nl%3Apublications%2F73e095ec-91b9-486d-8b98-1df98fb2c490
https://dblp.uni-trier.de/db/journals/corr/corr1607.html#PatelR16
https://doi.org/10.1137/16M1101003
https://epubs.siam.org/doi/abs/10.1137/16M1101003

Polynomial-time approximation algorithms for the coloring problem in some cases

Autoři: Dmitriy S. Malyshev

Zdroj: Journal of Combinatorial Optimization. 33:809-813

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

Přístupová URL adresa: https://publications.hse.ru/en/articles/178587098
https://link.springer.com/article/10.1007/s10878-016-0008-x/fulltext.html
https://link.springer.com/content/pdf/10.1007%2Fs10878-016-0008-x.pdf
https://link.springer.com/article/10.1007/s10878-016-0008-x
https://dblp.uni-trier.de/db/journals/jco/jco33.html#Malyshev17

Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs

Autoři: Dyer, Martin Heinrich, Marc Jerrum, Mark a další

Témata: Computer Science - Data Structures and Algorithms, Computer Science - Computational Complexity, Mathematics - Probability, 68Q25 (Primary) 68Q17, 68Q87, 82B20 (Secondary), text

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

Polynomial-Time Approximation Algorithms for Weighted LCS Problem

Autoři: Marek Cygan Marcin Kubica Wojciech Rytter a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783642214578

Témata: 0301 basic medicine, 03 medical and health sciences, 4. Education, 0102 computer and information sciences, 16. Peace & justice, 01 natural sciences, 7. Clean energy

Přístupová URL adresa: https://dblp.uni-trier.de/db/conf/cpm/cpm2011.html#CyganKRRW11
https://link.springer.com/chapter/10.1007/978-3-642-21458-5_38
https://rd.springer.com/chapter/10.1007/978-3-642-21458-5_38
https://www.cs.ucr.edu/~stelo/cpm/cpm11/38.cygan.pdf
https://www.mimuw.edu.pl/~walen/publ/2011-cpm-wlcs-slides.pdf
https://link.springer.com/content/pdf/10.1007%2F978-3-642-21458-5_38.pdf
https://dblp.uni-trier.de/db/journals/dam/dam204.html#CyganKRRW16
https://www.sciencedirect.com/science/article/pii/S0166218X15005636
https://dl.acm.org/doi/10.1016/j.dam.2015.11.011
https://doi.org/10.1016/j.dam.2015.11.011
https://www.sciencedirect.com/science/article/pii/S0166218X15005636#!
https://www.sciencedirect.com/science/article/abs/pii/S0166218X15005636

Polynomial-time approximation algorithms for anchor-free TDoA localization

Autoři: Wendeberg, Johannes Schindelhauer, Christian

Zdroj: Theoretical Computer Science. 553:27-36

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

Polynomial time approximation algorithms for proportionate open‐shop scheduling

Autoři: Mehdi Yazdani Mostafa Zandieh Bahman Naderi

Zdroj: International Transactions in Operational Research. 21:1031-1044

Témata: 8. Economic growth, 0211 other engineering and technologies, 02 engineering and technology, 3. Good health

Přístupová URL adresa: https://onlinelibrary.wiley.com/doi/10.1111/itor.12087
https://dblp.uni-trier.de/db/journals/itor/itor21.html#NaderiZY14

Polynomial Time Approximation Algorithms for Multi-Constrained QoS Routing

Autoři: Krishnaiyan Thulasiraman Jian Tang Guoliang Xue a další

Zdroj: IEEE/ACM Transactions on Networking. 16:656-669

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

Přístupová URL adresa: http://ieeexplore.ieee.org/document/4460528
https://doi.acm.org/10.1145/1399562.1399575
https://dl.acm.org/citation.cfm?id=1399575
https://asu.pure.elsevier.com/en/publications/polynomial-time-approximation-algorithms-for-multi-constrained-qo
https://dblp.uni-trier.de/db/journals/ton/ton16.html#XueZTT08
https://ieeexplore.ieee.org/document/4460528

C7.3 - Polynomial Time Approximation Algorithms for Localization based on Unknown Signals

Autoři: Ch. Schindelhauer Johannes Wendeberg

Zdroj: Proceedings SENSOR 2013. :461-466

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://www.ama-science.org/proceedings/getFile/ZGH0At==
https://www.ama-science.org/proceedings/details/1546
https://www.ama-science.org/proceedings/getFile/ZGH0At==

On polynomial-time approximation algorithms for the variable length scheduling problem: On polynomial-time approximation algorithms for the variable length scheduling problem.

Autoři: Daya Ram Gaur Michele Zito Leszek Gasieniec a další

Zdroj: Theoretical Computer Science. 302:489-495

Témata: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Performance evaluation, queueing, and scheduling in the context of computer systems, Theoretical Computer Science, Computer Science(all)

Popis souboru: application/xml

Polynomial time approximation algorithms for machine scheduling: ten open problems: Polynomial time approximation algorithms for machine scheduling: Ten open problems

Autoři: Gerhard J. Woeginger Petra Schuurman

Zdroj: Journal of Scheduling. 2:203-213

Témata: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming, Deterministic scheduling theory in operations research, scheduling problems, deterministic machine scheduling, open problems, worst case analysis, approximation algorithms

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1356647
https://doi.org/10.1002/(sici)1099-1425(199909/10)2:5<203::aid-jos26>3.0.co;2-5
https://research.tue.nl/en/publications/2362b628-d626-44ef-a9c5-7e4e9ff3258a
https://doi.org/10.1002/(SICI)1099-1425(199909/10)2:5<203::AID-JOS26>3.0.CO;2-5
https://onlinelibrary.wiley.com/doi/10.1002/(SICI)1099-1425(199909/10)2:5<203::AID-JOS26>3.0.CO;2-5/abstract
https://onlinelibrary.wiley.com/doi/abs/10.1002/%28SICI%291099-1425%28199909/10%292%3A5%3C203%3A%3AAID-JOS26%3E3.0.CO%3B2-5
https://www.narcis.nl/publication/RecordID/oai%3Apure.tue.nl%3Apublications%2F2362b628-d626-44ef-a9c5-7e4e9ff3258a
http://onlinelibrary.wiley.com/doi/10.1002/(SICI)1099-1425(199909/10)2:5<203::AID-JOS26>3.0.CO;2-5/pdf

Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials

Autoři: Patel, Viresh Regts, Guus

Témata: Mathematics - Combinatorics, Computer Science - Computational Complexity, Computer Science - Discrete Mathematics, Computer Science - Data Structures and Algorithms, text

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

Complexity and Polynomial-Time Approximation Algorithms around the Scaffolding Problem

Autoři: Chateau, Annie Giroudeau, Rodolphe Dediu, Adrian-Horia a další

Přispěvatelé: Chateau, Annie Giroudeau, Rodolphe Dediu, Adrian-Horia a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783319079523

Témata: 0301 basic medicine, 03 medical and health sciences, Polynomial-Time Approximation, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Complexity, 0102 computer and information sciences, Scaffolding, 01 natural sciences, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM]

Přístupová URL adresa: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01007556
https://rd.springer.com/chapter/10.1007/978-3-319-07953-0_4
https://link.springer.com/chapter/10.1007/978-3-319-07953-0_4
https://doi.org/10.1007/978-3-319-07953-0_4

Polynomial Time Approximation Algorithms for Localization Based on Unknown Signals

Autoři: Christian Schindelhauer Johannes Wendeberg

Zdroj: Lecture Notes in Computer Science ISBN: 9783642360916

Přístupová URL adresa: http://www.ama-science.org/proceedings/getFile/ZGH0At%3D%3D/
https://rd.springer.com/chapter/10.1007/978-3-642-36092-3_15
http://archive.cone.informatik.uni-freiburg.de/wendeberg/files/papers/algosensors2012_paper_wendeberg.pdf
https://link.springer.com/chapter/10.1007/978-3-642-36092-3_15
https://dblp.uni-trier.de/db/conf/algosensors/algosensors2012.html#WendebergS12
http://www.ama-science.org/proceedings/getFile/ZGH0At==
https://www.ama-science.org/proceedings/getFile/ZGH0At==

A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme

Autoři: Saller, Sophia Koehler, Jana Karrenbauer, Andreas

Témata: ddc:000, Traveling Salesperson, Traveling Salesman, Definition scheme, Polynomial-time approximation algorithms

Relation: https://hdl.handle.net/10419/330620

Dostupnost: https://hdl.handle.net/10419/330620
https://doi.org/10.1007/s10479-025-06641-5

Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials.

Autoři: Patel, Viresh Regts, Guus

Zdroj: Electronic Notes in Discrete Mathematics. Aug2017, Vol. 61, p971-977. 7p.

Polynomial-time approximation algorithms for weighted LCS problem

Autoři: Cygan, M. Kubica, M. Radoszewski, J. a další

Zdroj: Discrete Applied Mathematics ; volume 204, page 38-48 ; ISSN 0166-218X

Dostupnost: http://dx.doi.org/10.1016/j.dam.2015.11.011
https://api.elsevier.com/content/article/PII:S0166218X15005636?httpAccept=text/plain
https://api.elsevier.com/content/article/PII:S0166218X15005636?httpAccept=text/xml

Polynomial time approximation algorithms for machine scheduling: Ten open problems

Autoři: Petra Schuurman Gerhard J. Woeginger The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Petra Schuurman Gerhard J. Woeginger The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.technion.ac.il/~rabani/pss/236605.00.sp/Gerhard.ps.

Popis souboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.2177; http://www.cs.technion.ac.il/~rabani/pss/236605.00.sp/Gerhard.ps

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.2177
http://www.cs.technion.ac.il/~rabani/pss/236605.00.sp/Gerhard.ps