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

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

On Multiprocessor Temperature-Aware Scheduling Problems

Autoři: Bampis, Evripidis Letsios, Dimitrios Lucarelli, Giorgio a další

Přispěvatelé: Bampis, Evripidis Letsios, Dimitrios Lucarelli, Giorgio a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783642296994

Témata: Temperature-aware scheduling, Makespan, Scheduling problem, Maximum temperature, Optimization criteria, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Approximation algorithms, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], temperature-aware scheduling problems, Weighted averages, Polynomial time approximation algorithms, Polynomial-time algorithms, Identical processors, optimization, Recherche opérationnelle, Inapproximability

Popis souboru: application/pdf

Přístupová URL adresa: https://hal.archives-ouvertes.fr/hal-00875550/file/cahier_310.pdf
https://basepub.dauphine.psl.eu/bitstream/123456789/6309/1/cahier310.PDF
https://www.archives-ouvertes.fr/hal-00820172
https://hal.archives-ouvertes.fr/hal-00820172
https://dblp.uni-trier.de/db/conf/aaim/aaim2012.html#BampisLLMM12
https://hal.science/hal-00801394v1
https://doi.org/10.1007/s10951-013-0319-z

Approximation Algorithms for Independent Sets in Map Graphs: Approximation algorithms for independent sets in map graphs

Autoři: Zhi-Zhong Chen

Zdroj: Lecture Notes in Computer Science ISBN: 9783540677871

Témata: Graph theory (including graph drawing) in computer science, planar graph, 0102 computer and information sciences, polynomial-time approximation algorithms, 01 natural sciences, map graph

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1695228
https://doi.org/10.1006/jagm.2001.1178
https://dblp.uni-trier.de/db/journals/jal/jal41.html#Chen01a
http://www.sciencedirect.com/science/article/pii/S0196677401911782
https://www.sciencedirect.com/science/article/abs/pii/S0196677401911782
https://doi.org/10.1006/jagm.2001.1178
https://link.springer.com/chapter/10.1007/3-540-44968-X_11
https://rd.springer.com/chapter/10.1007%2F3-540-44968-X_11
https://dblp.uni-trier.de/db/conf/cocoon/cocoon2000.html#Chen00

SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES

Autoři: JINJIANG YUAN LEI SHI JINWEN OU

Zdroj: Asia-Pacific Journal of Operational Research. 25:317-325

Témata: Forbidden intervals, delivery times, polynomial time approximation algorithms, PTAS, performance ratio, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/apjor/apjor25.html#YuanSO08
https://www.worldscientific.com/doi/abs/10.1142/S0217595908001778
https://ideas.repec.org/a/wsi/apjorx/v25y2008i03ns0217595908001778.html
http://www.worldscinet.com/cgi-bin/details.cgi?type=pdf&id=pii:S0217595908001778
http://www.worldscinet.com/cgi-bin/details.cgi?type=html&id=pii:S0217595908001778

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

Finding Optimal Shadows of Polytopes: Finding optimal shadows of polytopes

Autoři: Thomas Burger Peter Gritzmann

Zdroj: Discrete & Computational Geometry. 24:219-240

Témata: computational complexity, Computer graphics, computational geometry (digital and algorithmic aspects), Polytopes and polyhedra, 0211 other engineering and technologies, Complexity classes (hierarchies, relations among complexity classes, etc.), 0102 computer and information sciences, 02 engineering and technology, polynomial-time approximation algorithms, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://link.springer.com/content/pdf/10.1007%2Fs004540010029.pdf
https://dblp.uni-trier.de/db/journals/dcg/dcg24.html#BurgerG00
https://link.springer.com/content/pdf/10.1007/s004540010029.pdf
https://link.springer.com/article/10.1007/s004540010029
https://mediatum.ub.tum.de/1368019
https://doi.org/10.1007/s004540010029

Near optimal multiple alignment within a band in polynomial time

Autoři: Ming Li Bin Ma Lusheng Wang

Zdroj: Journal of Computer and System Sciences. 73:997-1011

Témata: 0301 basic medicine, 03 medical and health sciences, Computational Theory and Mathematics, Computer Networks and Communications, Applied Mathematics, 0206 medical engineering, Polynomial time approximation algorithms, Multiple sequence alignment within a band, 02 engineering and technology, Theoretical Computer Science

Přístupová URL adresa: https://core.ac.uk/display/21687414
https://dl.acm.org/doi/10.1145/335305.335354
https://dblp.uni-trier.de/db/conf/stoc/stoc2000.html#LiMW00
https://www.sciencedirect.com/science/article/pii/S0022000007000281
https://dblp.uni-trier.de/db/journals/jcss/jcss73.html#MaWL07
http://dblp.uni-trier.de/db/journals/jcss/jcss73.html#MaWL07
https://core.ac.uk/display/82045648

Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries

Autoři: Shoshana Anily Julien Bramel

Zdroj: Naval Research Logistics. 46:654-670

Témata: worst-case bounds, polynomial-time approximation algorithms, Operations research and management science, capacitated traveling salesman problem

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1357792
https://doi.org/10.1002/(sici)1520-6750(199909)46:6<654::aid-nav4>3.0.co;2-a
http://onlinelibrary.wiley.com/doi/10.1002/(SICI)1520-6750(199909)46:6%3C654::AID-NAV4%3E3.0.CO;2-A/references
http://onlinelibrary.wiley.com/doi/10.1002/(SICI)1520-6750(199909)46:6%3C654::AID-NAV4%3E3.0.CO;2-A/abstract
http://www.tau.ac.il/~anily/publications/21.pdf
https://onlinelibrary.wiley.com/doi/abs/10.1002/%28SICI%291520-6750%28199909%2946%3A6%3C654%3A%3AAID-NAV4%3E3.0.CO%3B2-A

A Note on the Approximation of a Minimum-Weight Maximal Independent Set: A note on the approximation of a minimum-weight maximal independent set

Autoři: Marc Demange

Zdroj: Computational Optimization and Applications. 14:157-169

Témata: independent set, computational complexity, combinatorial problem, 0102 computer and information sciences, Programming involving graphs or networks, 0101 mathematics, Abstract computational complexity for mathematical programming problems, polynomial-time approximation algorithms, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1339082
https://doi.org/10.1023/a:1008765214400

The Stock Size Problem: The stock size problem

Autoři: Gerhard J. Woeginger Vladimir Kotov Franz Rendl a další

Zdroj: Operations Research. 46:S1-S12

Témata: Deterministic scheduling theory in operations research, polynomial time approximation algorithms, numerical simulation, 8. Economic growth, 0211 other engineering and technologies, Inventory, storage, reservoirs, scheduling, 0102 computer and information sciences, 02 engineering and technology, inventory control, optimum stock size, Approximation methods and heuristics in mathematical programming, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1720773
https://doi.org/10.1287/opre.46.3.s1
https://pubsonline.informs.org/doi/pdf/10.1287/opre.46.3.S1
https://pubsonline.informs.org/doi/abs/10.1287/opre.46.3.S1
https://dblp.uni-trier.de/db/journals/ior/ior46.html#KellererKRW98
https://ideas.repec.org/a/inm/oropre/v46y1998i3-supplement-3ps1-s12.html

Improved bounds on the max-flow min-cut ratio for multicommodity flows

Autoři: Éva Tardos Serge Plotkin

Zdroj: Combinatorica. 15:425-434

Témata: multicommodity flow problems, Analysis of algorithms and problem complexity, Graph theory (including graph drawing) in computer science, polynomial time approximation algorithms, 0102 computer and information sciences, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://ecommons.cornell.edu/bitstream/1813/8927/1/TR001042.pdf
https://core.ac.uk/display/22185667
https://dl.acm.org/doi/10.1145/167088.167263
https://link.springer.com/article/10.1007%2FBF01299746
https://dblp.uni-trier.de/db/conf/stoc/stoc1993.html#PlotkinT93
https://link.springer.com/article/10.1007/BF01299746
https://link.springer.com/content/pdf/10.1007/BF01299746.pdf
https://dblp.uni-trier.de/db/journals/combinatorica/combinatorica15.html#PlotkinT95

Approximation Algorithms for Fixed Job Schedule Problems: Approximation algorithms for fixed job schedule problems

Autoři: FISCHETTI, MATTEO S. Martello P. Toth

Zdroj: Operations Research. 40:S96-S108

Témata: fixed job schedule problem, Deterministic scheduling theory in operations research, Computational methods for problems pertaining to operations research and mathematical programming, preemptive relaxation, 8. Economic growth, 0211 other engineering and technologies, 02 engineering and technology, greedy solution, Abstract computational complexity for mathematical programming problems, polynomial-time approximation algorithms, 7. Clean energy

Popis souboru: application/xml

Přístupová URL adresa: https://hdl.handle.net/11577/2499252

Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times

Autoři: Stanisłlaw Zdrzałka

Zdroj: European Journal of Operational Research. 51:199-209

Témata: worst-case behavior, Deterministic scheduling theory in operations research, single machine, unit set-up time, 8. Economic growth, maximum delivery time, NP-hard, polynomial-time approximation algorithms

Popis souboru: application/xml

Přístupová URL adresa: https://ideas.repec.org/a/eee/ejores/v51y1991i2p199-209.html
https://www.sciencedirect.com/science/article/pii/037722179190250Y
https://EconPapers.repec.org/RePEc:eee:ejores:v:51:y:1991:i:2:p:199-209

Nonstrict Vector Summation in Scheduling Problems: Nonstrict vector summation in scheduling problems

Autoři: S. V. Sevast’yanov

Zdroj: Discrete Analysis and Operations Research ISBN: 9789401072175

Témata: vector summation, flow shops, Deterministic scheduling theory in operations research, three machines, assembly line, polynomial-time approximation algorithms, job shops

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/808808
https://rd.springer.com/chapter/10.1007/978-94-009-1606-7_18
https://link.springer.com/content/pdf/10.1007%2F978-94-009-1606-7_18.pdf
https://link.springer.com/chapter/10.1007/978-94-009-1606-7_18

Nonstrict Vector Summation in Multi-Operation Scheduling

Autoři: Sergey Sevastianov The Pennsylvania State University CiteSeerX Archives

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

Zdroj: ftp://ftp.win.tue.nl/pub/techreports/cosor/95-37.ps

Témata: open-shop, flow shop, job shop, scheduling, polynomial-time approximation algorithms, sequencing of vectors

Popis souboru: application/postscript

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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.6937

The d-identifying codes problem for vertex identification in graphs: Probabilistic analysis and an approximation algorithm

Autoři: Xiao, Y. Hadjicostis, Christoforos N. Thulasiraman, K. a další

Přispěvatelé: Xiao, Y. Hadjicostis, Christoforos N. Thulasiraman, K. a další

Zdroj: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Lect. Notes Comput. Sci.

Témata: Information theory, Sensors, Code problems, Approximation theory, Codes (symbols), 0102 computer and information sciences, 01 natural sciences, Probabilistic logics, Polynomials, Tracking (position), Graphic methods, Polynomial time approximation algorithms, Algorithms, Fault diagnosis, Random graphs

Přístupová URL adresa: http://gnosis.library.ucy.ac.cy/handle/7/45105

The complexity of approximating PSPACE-Complete problems for hierarchical specifications: The complexity of approximating PSPACE-complete problems for hierarchical specifications

Autoři: Marathe, Madhav V. Hunt, Harry B. III Ravi, S. S.

Témata: FOS: Computer and information sciences, Specification and verification (program logics, model checking, etc.), Analysis of algorithms and problem complexity, 68Q25, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, hierarchically specified graphs, Computer Science - Computational Complexity, Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.), Graph theory (including graph drawing) in computer science, polynomial time approximation algorithms, 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, Complexity classes (hierarchies, relations among complexity classes, etc.), Mathematics - Combinatorics, Combinatorics (math.CO)

Popis souboru: application/xml

Přístupová URL adresa: http://arxiv.org/abs/math/9409225
https://zbmath.org/751134

The Steiner problem: a survey: The Steiner problem: A survey

Autoři: O.G. Tarastsov E.N. Gordeev

Zdroj: Discrete Mathematics and Applications. 3

Témata: Gilbert-Pollak conjecture, 0211 other engineering and technologies, Research exposition (monographs, survey articles) pertaining to combinatorics, Steiner trees, survey, 0102 computer and information sciences, 02 engineering and technology, polynomial-time approximation algorithms, 01 natural sciences, Trees

Popis souboru: application/xml

Přístupová URL adresa: https://www.degruyter.com/view/j/dma.1993.3.issue-4/dma-1993-0402/dma-1993-0402.xml
https://www.degruyter.com/view/j/dma.1993.3.issue-4/dma-1993-0402/dma-1993-0402.xml?lang=en

Finding Augmented-Set Bases: Finding augmented-set bases

Autoři: Virgil D. Gligor David Maier

Zdroj: SIAM Journal on Computing. 11:602-609

Témata: Discrete mathematics in relation to computer science, Analysis of algorithms and problem complexity, augmentation problems, deletion problems, 0102 computer and information sciences, polynomial-time approximation algorithms, NP-complete problems, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/3765136
https://doi.org/10.1137/0211051

On the approximation of some spanning-arborescence problems

Autoři: Alfandari, Laurent Paschos, Vangelis

Témata: Polynomial-time approximation algorithms, master-slave game, Recherche opérationnelle

Time: 003

Relation: Advances in Computer and Information Science '98. Proceedings of the 13th International Symposium on Computer and Information Sciences; Güdükbay, U.; Dayar, T.; Gürsoy, A.; Gelenbe, E.; IOS Press; Amsterdam; 1998; 90-5199-405-2; ISCIS'98; 1998-10; Ankara; Turquie; https://basepub.dauphine.fr/handle/123456789/4525

Dostupnost: https://basepub.dauphine.fr/handle/123456789/4525