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

Συγγραφείς: Saller, Sophia, Koehler, Jana, Karrenbauer, Andreas^{Aff3, IDs10479025066415_cor1}

Πηγή: Annals of Operations Research. 351(3):2129-2190

Algorithms for a Variant of the Full Steiner Tree Problem

Συγγραφείς: Wang, Haiyan, Huang, Binchao, Li, Jianping

Πηγή: 2021 IEEE/ACIS 19th International Conference on Computer and Information Science (ICIS) Computer and Information Science (ICIS), 2021 IEEE/ACIS 19th International Conference on. :16-21 Jun, 2021

Relation: 2021 IEEE/ACIS 19th International Conference on Computer and Information Science (ICIS)

A Fast and Accurate Failure Frequency Approximation for $k$ -Terminal Reliability Systems

Συγγραφείς: Heidarzadeh, A., Sprintson, A., Singh, C.

Πηγή: IEEE Transactions on Reliability IEEE Trans. Rel. Reliability, IEEE Transactions on. 67(3):933-950 Sep, 2018

On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks

Συγγραφείς: Zhang, Shurong ^{a, ⁎}, Chen, Lin ^b, Yang, Weihua ^a

Πηγή: In Theoretical Computer Science 26 September 2017 695:74-82

On Multiprocessor Temperature-Aware Scheduling Problems

Συγγραφείς: Bampis, Evripidis, Letsios, Dimitrios, Lucarelli, Giorgio, Markakis, Evangelos, Milis, Ioannis Z.

Συνεισφορές: Davesne, Frédéric

Πηγή: Lecture Notes in Computer Science ISBN: 9783642296994

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: Zhi-Zhong Chen

Πηγή: Lecture Notes in Computer Science ISBN: 9783540677871

Θεματικοί όροι: Graph theory (including graph drawing) in computer science, planar graph, 0102 computer and information sciences, polynomial-time approximation algorithms, 01 natural sciences, map graph

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: JINJIANG YUAN, LEI SHI, JINWEN OU

Πηγή: Asia-Pacific Journal of Operational Research. 25:317-325

Θεματικοί όροι: 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

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: Alistair Sinclair, Mark Jerrum

Πηγή: Lecture Notes in Computer Science ISBN: 3540528261

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: Thomas Burger, Peter Gritzmann

Πηγή: Discrete & Computational Geometry. 24:219-240

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: Ming Li, Bin Ma, Lusheng Wang

Πηγή: Journal of Computer and System Sciences. 73:997-1011

Θεματικοί όροι: 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

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: Shoshana Anily, Julien Bramel

Πηγή: Naval Research Logistics. 46:654-670

Θεματικοί όροι: worst-case bounds, polynomial-time approximation algorithms, Operations research and management science, capacitated traveling salesman problem

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: Marc Demange

Πηγή: Computational Optimization and Applications. 14:157-169

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/1339082
https://doi.org/10.1023/a:1008765214400

The Stock Size Problem: The stock size problem

Συγγραφείς: Gerhard J. Woeginger, Vladimir Kotov, Franz Rendl, Hans Kellerer

Πηγή: Operations Research. 46:S1-S12

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: Éva Tardos, Serge Plotkin

Πηγή: Combinatorica. 15:425-434

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: FISCHETTI, MATTEO, S. Martello, P. Toth

Πηγή: Operations Research. 40:S96-S108

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://hdl.handle.net/11577/2499252

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

Συγγραφείς: Stanisłlaw Zdrzałka

Πηγή: European Journal of Operational Research. 51:199-209

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: S. V. Sevast’yanov

Πηγή: Discrete Analysis and Operations Research ISBN: 9789401072175

Θεματικοί όροι: vector summation, flow shops, Deterministic scheduling theory in operations research, three machines, assembly line, polynomial-time approximation algorithms, job shops

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: Sergey Sevastianov

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: ftp://ftp.win.tue.nl/pub/techreports/cosor/95-37.ps

Θεματικοί όροι: open-shop, flow shop, job shop, scheduling, polynomial-time approximation algorithms, sequencing of vectors

Περιγραφή αρχείου: application/postscript

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

Διαθεσιμότητα: 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

Συγγραφείς: Xiao, Y., Hadjicostis, Christoforos N., Thulasiraman, K.

Συνεισφορές: Hadjicostis, Christoforos N. [0000-0002-1706-708X]

Πηγή: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Lect. Notes Comput. Sci.

Θεματικοί όροι: 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

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: Marathe, Madhav V., Hunt, Harry B. III, Ravi, S. S.

Θεματικοί όροι: 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)

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/math/9409225
https://zbmath.org/751134