Výsledky vyhledávání - "Approximation algorithms for NP-hard problems"

Typical performance of approximation algorithms for NP-hard problems.

Additional Titles: Typical performance of approximation algorithms for NP-hard problems

Autoři: Takabe, Satoshi

Témata: Journal Article., NA.

URL: http://t2r2.star.titech.ac.jp/cgi-bin/publicationinfo.cgi?q_publication_content_number=CTT100861692
https://doi.org/10.1088/1742-5468/2016/11/113401

Approximation Algorithms for NP-Hard Problems

Autoři: Indu Gupta,Pankaj Kumar,Vishakha Verma

Approximation Algorithms for NP-Hard Problems: Approximation algorithms for NP-hard problems

Autoři: Marek Karpinski Ravi Kannan

Zdroj: Oberwolfach Reports. 1:1461-1540

Témata: Collections of abstracts of lectures, Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming, Approximation methods and heuristics in mathematical programming, Approximation algorithms

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/2175109
https://doi.org/10.4171/owr/2004/28
https://www.ems-ph.org/journals/show_abstract.php?issn=1660-8933&vol=1&iss=3&rank=1

Book review: Approximation Algorithms for NP-hard Problems. Edited by Dorit S. Hochbaum (PWS, 1997)

Autoři: Yoram J. Sussmann Randeep Bhatia

Zdroj: ACM SIGACT News. 29:17-20

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

Přístupová URL adresa: https://dl.acm.org/doi/10.1145/288079.1041951
https://dblp.uni-trier.de/db/journals/sigact/sigact29.html#BhatiaS98

Approximation Algorithms for NP-Hard Problems

Zdroj: ACM SIGACT News. 28:40-52

Typical Performance of Approximation Algorithms for NP-hard Problems

Autoři: Takabe, Satoshi Hukushima, Koji

Témata: Condensed Matter - Disordered Systems and Neural Networks, Condensed Matter - Statistical Mechanics, Computer Science - Data Structures and Algorithms, text

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

Approximation algorithms for NP-hard problems / ed. by Dorit S. Hochbaum.

Přispěvatelé: Hochbaum, Dorit.

Zdroj: Indeks.
Bibliogr. przy poszczególnych rozdziałach.

Přístupová URL adresa: http://katalog.nukat.edu.pl/lib/item?id=chamo:1962784&theme=nukat

Approximation Algorithms for NP-Hard Problems

Témata: Konferenzschrift

Approximation Algorithms for NP-Hard Problems

Autoři: Mathematisches Forschungsinstitut Oberwolfach

Typical performance of approximation algorithms for NP-hard problems

Autoři: Koji Hukushima Satoshi Takabe

Zdroj: Journal of Statistical Mechanics: Theory and Experiment. 2016:113401

Témata: FOS: Computer and information sciences, Statistical Mechanics (cond-mat.stat-mech), Computer Science - Data Structures and Algorithms, 0103 physical sciences, FOS: Physical sciences, Data Structures and Algorithms (cs.DS), Disordered Systems and Neural Networks (cond-mat.dis-nn), Condensed Matter - Disordered Systems and Neural Networks, 16. Peace & justice, 01 natural sciences, Condensed Matter - Statistical Mechanics, 6. Clean water

Přístupová URL adresa: http://arxiv.org/pdf/1605.04679
http://arxiv.org/abs/1605.04679
https://iopscience.iop.org/article/10.1088/1742-5468/2016/11/113401/meta
http://dblp.uni-trier.de/db/journals/corr/corr1605.html#TakabeH16a
https://samurai.nims.go.jp/articles/8436449a-fd6e-469e-b75e-ae092a8a229c?locale=en
https://ui.adsabs.harvard.edu/abs/2016JSMTE..11.3401T/abstract
https://dblp.uni-trier.de/db/journals/corr/corr1605.html#TakabeH16a
https://jglobal.jst.go.jp/en/detail?JGLOBAL_ID=201902216491705762
https://core.ac.uk/display/42724582
https://arxiv.org/pdf/1605.04679.pdf
https://www.arxiv.org/abs/1605.04679
https://128.84.21.199/abs/1605.04679

Typical performance of approximation algorithms for NP-hard problems

Autoři: 髙邉賢史 Satoshi Takabe Koji Hukushima

Relation: oai:t2r2.star.titech.ac.jp:50596179

Dostupnost: http://t2r2.star.titech.ac.jp/cgi-bin/publicationinfo.cgi?q_publication_content_number=CTT100861692

Approximation Algorithms for NP-Hard Problems

Autoři: Ravi Kannan Marek Karpinski Hans Jürgen Prömel a další

Přispěvatelé: Ravi Kannan Marek Karpinski Hans Jürgen Prömel a další

Zdroj: http://www.mfo.de/programme/schedule/2004/24/OWR_2004_28.pdf.

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.1335; http://www.mfo.de/programme/schedule/2004/24/OWR_2004_28.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.1335
http://www.mfo.de/programme/schedule/2004/24/OWR_2004_28.pdf

The Markov chain Monte Carlo Method: an approach to approximate counting and integration, in: Approximation Algorithms for NP-hard Problems

Autoři: Mark Jerrum Alistair Sinclair The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Mark Jerrum Alistair Sinclair The Pennsylvania State University CiteSeerX Archives

Zdroj: http://kobus.ca/teaching/cs645/spring09/ua_only/jerrum_sinclair_96.pdf.

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.321.8322; http://kobus.ca/teaching/cs645/spring09/ua_only/jerrum_sinclair_96.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.321.8322
http://kobus.ca/teaching/cs645/spring09/ua_only/jerrum_sinclair_96.pdf

Typical performance of approximation algorithms for NP-hard problems

Zdroj: Typical performance of approximation algorithms for NP-hard problems. 2016(No. 11):113401

Local Ratio: A Unified Framework for Approximation Algorithms

Autoři: R. Bar-Yehuda K. Bendel A. Freund a další

Přispěvatelé: R. Bar-Yehuda K. Bendel A. Freund a další

Zdroj: http://www.cs.technion.ac.il/~reuven/PS/survey.ps.

Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems--Computations on discrete structures, Sequencing and scheduling General Terms, Algorithms, Performance Additional Key Words and Phrases, Approximation algorithms for NP-hard problems, dynamic storage allocation, general caching, scheduling, resource allocation

Popis souboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.475; http://www.cs.technion.ac.il/~reuven/PS/survey.ps

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.475
http://www.cs.technion.ac.il/~reuven/PS/survey.ps

A Unified Approach to Approximating Resource Allocation and Scheduling

Autoři: Amotz Bar-Noy Reuven Bar-Yehuda Ari Freund a další

Přispěvatelé: Amotz Bar-Noy Reuven Bar-Yehuda Ari Freund a další

Zdroj: http://www.cs.technion.ac.il/~arief/papers/unified-jacm.ps.

Témata: General Terms, Algorithms, Performance Additional Key Words and Phrases, Approximation algorithms for NP-hard problems, dynamic storage allocation, general caching, scheduling, resource allocation

Popis souboru: application/postscript

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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.385
http://www.cs.technion.ac.il/~arief/papers/unified-jacm.ps

Typical performance of approximation algorithms for NP-hard problems.

Autoři: Satoshi Takabe Koji Hukushima

Zdroj: Journal of Statistical Mechanics: Theory & Experiment; Nov2016, Vol. 2016 Issue 11, p1-1, 1p

A Unified Approach to Approximating Resource Allocation and Scheduling

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

Zdroj: http://www.sci.brooklyn.cuny.edu/~amotz/PUBLICATIONS/bw.ps.

Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems--Computations on discrete structures, Sequencing and scheduling General Terms, Algorithms, Performance Additional Key Words and Phrases, Approximation algorithms for NP-hard problems, dynamic storage allocation, general caching, scheduling, resource allocation

Popis souboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.4260; http://www.sci.brooklyn.cuny.edu/~amotz/PUBLICATIONS/bw.ps

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.4260
http://www.sci.brooklyn.cuny.edu/~amotz/PUBLICATIONS/bw.ps

k-Anonymization with Minimal Loss of Information.

Autoři: Gionis, Aristides Tassa, Tamir

Zdroj: IEEE Transactions on Knowledge & Data Engineering. Feb2009, Vol. 21 Issue 2, p206-219. 14p. 2 Charts.

Témata: *DATABASES, *ELECTRONIC data processing, *INFORMATION storage & retrieval systems, *MARKETING, *DATA mining, *APPROXIMATION theory, *ALGORITHMS

On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP.

Autoři: C.S., Karthik Lee, Euiwoong Manurangsi, Pasin

Zdroj: Algorithmica; Dec2025, Vol. 87 Issue 12, p1711-1731, 21p

Témata: COMPUTATIONAL complexity, COMBINATORIAL optimization, MATHEMATICAL optimization, APPROXIMATION algorithms, CONSTRAINT satisfaction