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

Single-machine scheduling with machine unavailability periods and resource dependent processing times

Autoři: Dvir Shabtay

Zdroj: European Journal of Operational Research. 296:423-439

Témata: controllable processing time, machine unavailability period, Deterministic scheduling theory in operations research, single-machine scheduling, pseudo polynomial time algorithm, 0211 other engineering and technologies, resource allocation, 02 engineering and technology, approximation algorithms, 12. Responsible consumption

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/7422936
https://doi.org/10.1016/j.ejor.2021.03.034
https://www.sciencedirect.com/science/article/pii/S0377221721002605
https://doi.org/10.1016/j.ejor.2021.03.034
https://dblp.uni-trier.de/db/journals/eor/eor296.html#Shabtay22

Supply chain scheduling with receiving deadlines and non-linear penalty

Autoři: Wang, G Lei, L Lee, K

Přispěvatelé: Wang, G Lei, L Lee, K

Zdroj: Journal of the Operational Research Society. 66:380-391

Témata: dynamic programming, pseudo-polynomial time algorithm, capacitated facilities, deadline constraints, 0211 other engineering and technologies, 02 engineering and technology, operations scheduling, 3. Good health

Přístupová URL adresa: http://www.palgrave-journals.com/jors/journal/v66/n3/pdf/jors20142a.pdf
http://www.palgrave-journals.com/jors/journal/v66/n3/full/jors20142a.html

Single-machine scheduling with trade-off between number of tardy jobs and compression cost

Autoři: He, Y Wei, Q Cheng, TCE a další

Přispěvatelé: He, Y Wei, Q Cheng, TCE a další

Zdroj: Journal of Scheduling. 10:303-310

Témata: pseudo-polynomial time algorithm, controllable processing times, Single-machine scheduling problem, Deterministic scheduling theory in operations research, Strongly polynomial time algorithm, 8. Economic growth, 0211 other engineering and technologies, Pseudo-polynomial time algorithm, strongly polynomial time algorithm, 02 engineering and technology, single-machine scheduling problem, Controllable processing times

Popis souboru: application/xml

Přístupová URL adresa: https://link.springer.com/article/10.1007/s10951-007-0027-7
https://core.ac.uk/display/61007599
https://ira.lib.polyu.edu.hk/handle/10397/1143
https://research.polyu.edu.hk/en/publications/single-machine-scheduling-with-trade-off-between-number-of-tardy-

on the complexity of non preemptive shop scheduling with two jobs: On the complexity of non-preemptive shop scheduling with two jobs

Autoři: Tamás Kis

Zdroj: Computing. 69(1):37-49

Témata: pseudo-polynomial time algorithm, computational complexity, Deterministic scheduling theory in operations research, mixed shop scheduling

Popis souboru: application/xml

Přístupová URL adresa: https://link.springer.com/article/10.1007/s00607-002-1455-z
http://eprints.sztaki.hu/3016/
https://doi.org/10.1007/s00607-002-1455-z
https://link.springer.com/content/pdf/10.1007/s00607-002-1455-z.pdf
https://dblp.uni-trier.de/db/journals/computing/computing69.html#Kis02

The complexity of mean payoff games on graphs

Autoři: Uri Zwick Mike Paterson

Zdroj: Theoretical Computer Science. 158:343-359

Témata: pseudo-polynomial time algorithm, 0209 industrial biotechnology, Graph theory (including graph drawing) in computer science, polynomial reduction, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Game theory, Theoretical Computer Science, Computer Science(all)

Popis souboru: application/xml

Přístupová URL adresa: https://dl.acm.org/doi/10.1016/0304-3975%2895%2900188-3
http://www.sciencedirect.com/science/article/pii/0304397595001883
https://dblp.uni-trier.de/db/journals/tcs/tcs158.html#ZwickP96
https://core.ac.uk/display/82224004
https://www.sciencedirect.com/science/article/pii/0304397595001883
https://www.sciencedirect.com/science/article/abs/pii/0304397595001883

Discrete Optimal Transport with Independent Marginals is #P-Hard

Autoři: Taskesen, Bahar Shafieezadeh Abadeh, Soroosh Kuhn, Daniel a další

Témata: Optimal transport, Wasserstein distance, Complexity theory, Pseudo-polynomial time algorithm

Relation: SIAM Journal on Optimization; https://infoscience.epfl.ch/handle/20.500.14299/185983; 2203.01161

Dostupnost: https://doi.org/10.1137/22M1482044
https://infoscience.epfl.ch/handle/20.500.14299/185983
https://hdl.handle.net/20.500.14299/185983

A primal‐dual algorithm for the minimum average weighted length circuit problem: A primal-dual algorithm for the minimum average weighted length circuit problem

Autoři: Chengen Yang Dayong Jin

Zdroj: Networks. 21:705-712

Témata: pseudo-polynomial time algorithm, 0211 other engineering and technologies, minimum average weighted length circuit problem, 0102 computer and information sciences, 02 engineering and technology, Programming involving graphs or networks, Abstract computational complexity for mathematical programming problems, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/25950
https://doi.org/10.1002/net.3230210702
https://dblp.uni-trier.de/db/journals/networks/networks21.html#YangJ91
http://onlinelibrary.wiley.com/doi/10.1002/net.3230210702/abstract

Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights: Weighted-tardiness scheduling on parallel machines with proportional weights

Autoři: Robin O. Roundy Esther M. Arkin

Zdroj: Operations Research. 39:64-81

Témata: Deterministic scheduling theory in operations research, single machine, parallel machines, total weighted tardiness, Computational methods for problems pertaining to operations research and mathematical programming, heuristic, pseudo- polynomial time algorithm

Popis souboru: application/xml

Minimizing the number of late tasks with error constraint

Autoři: C. S. Wong Joseph Y.-T. Leung

Zdroj: [1990] Proceedings 11th Real-Time Systems Symposium. :32-40

Témata: Deterministic scheduling theory in operations research, 02 engineering and technology, Theoretical Computer Science, Computer Science Applications, imprecise computation model, pseudo-polynomial time algorithm, optimal schedule, Computational Theory and Mathematics, NP- hard, heuristic, 0202 electrical engineering, electronic engineering, information engineering, single processor, preemptive schedule, Performance evaluation, queueing, and scheduling in the context of computer systems, Information Systems

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/465565
https://doi.org/10.1006/inco.1993.1050
https://dblp.uni-trier.de/db/journals/iandc/iandc106.html#LeungW93
https://researchwith.njit.edu/en/publications/minimizing-the-number-of-late-tasks-with-error-constraint-2
http://www.sciencedirect.com/science/article/pii/S0890540183710503
https://www.sciencedirect.com/science/article/pii/S0890540183710503
https://core.ac.uk/display/82134125
https://researchwith.njit.edu/en/publications/minimizing-the-number-of-late-tasks-with-error-constraint-3
http://dblp.uni-trier.de/db/conf/rtss/rtss1990.html#LeungW90
http://ieeexplore.ieee.org/document/128726/
https://dblp.uni-trier.de/db/conf/rtss/rtss1990.html#LeungW90
https://ieeexplore.ieee.org/document/128726/

Pseudo Polynomial Time Algorithms for Optimal Longcut Route Selection

Autoři: Gen MOTOYOSHI Toshimitsu MASUZAWA Tutomu MURASE a další

Zdroj: IEICE Transactions on Information and Systems. 2015, E98.D(3):607

Spread of influence in weighted networks under time and budget constraints

Autoři: Cicalese, Ferdinando Cordasco, Gennaro Gargano, Luisa a další

Přispěvatelé: Cicalese, Ferdinando Cordasco, Gennaro Gargano, Luisa a další

Témata: Dynamic monopolie, Exact pseudo-polynomial time algorithm, Social network, Spread of influence, Viral marketing

Popis souboru: STAMPA

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000356751800005; volume:586; firstpage:40; lastpage:58; numberofpages:19; journal:THEORETICAL COMPUTER SCIENCE; https://hdl.handle.net/11562/933092

Dostupnost: https://hdl.handle.net/11562/933092
https://doi.org/10.1016/j.tcs.2015.02.032

Schedulability of event-driven code blocks in real-time embedded systems

Autoři: Lothar Thiele Samarjit Chakraborty Simon Künzli a další

Zdroj: Proceedings of the 39th conference on Design automation - DAC '02. :616

Témata: 0202 electrical engineering, electronic engineering, information engineering, approximate decision algorithms, control flow graph, demand-bound function, dynamic programming, event-driven code block schedulability, exact necessary sufficient conditions, hard real-time constraints, independently executing event-driven code blocks, network processors, nonpreemptive environment, pseudo-polynomial time algorithm, real-time embedded systems, schedulability analysis problem, embedded systems, flow graphs, polynomial approximation, processor scheduling, 02 engineering and technology, ddc

Přístupová URL adresa: https://www.research-collection.ethz.ch/bitstream/20.500.11850/147665/1/eth-26708-01.pdf
http://www.tik.ee.ethz.ch/file/9296c62e682bb8056c7207a18fba36fb/DAC02a.pdf
http://www.cecs.uci.edu/~papers/compendium94-03/papers/2002/dac02/pdffiles/40_1.pdf
https://ieeexplore.ieee.org/document/1012699/
https://dblp.uni-trier.de/db/conf/dac/dac2002.html#ChakrabortyEKT02
https://mediatum.ub.tum.de/1163192

Schedulability of event-driven code blocks in real-time embedded systems

Autoři: Chakraborty, S. Erlebach, T. Kunzli, S. a další

Témata: info:eu-repo/classification/ddc, approximate decision algorithms, control flow graph, demand-bound function, dynamic programming, event-driven code block schedulability, exact necessary sufficient conditions, hard real-time constraints, independently executing event-driven code blocks, network processors, nonpreemptive environment, pseudo-polynomial time algorithm, real-time embedded systems, schedulability analysis problem, embedded systems, flow graphs, polynomial approximation, processor scheduling

Relation: https://mediatum.ub.tum.de/1163192

Dostupnost: https://mediatum.ub.tum.de/1163192
https://doi.org/10.1109/DAC.2002.1012699

Approximation for multi-knapsack problem

Autoři: Zhang, Li'ang Li, Luyang Huang, Xiong

Témata: pseudo-polynomial time algorithm, Analysis of algorithms and problem complexity, polynomial-time approximation algorithm, Integer programming, Parallel algorithms in computer science, multi-knapsack problem, Abstract computational complexity for mathematical programming problems

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/940609

在平面圖上尋找兩條不共點且長度有限制的路徑之改良演算法 ; An Improved Algorithm for Finding Two Length-Bounded Vertex-Disjoint Paths in Planar Graphs

Autoři: 王俊傑 Jun-Jay Wang 王炳豐 a další

Přispěvatelé: 王俊傑 Jun-Jay Wang 王炳豐 a další

Témata: 平面圖, 無界限的區域, 傳輸策略, 路由器, 可靠度, planar graphs, pseudo-polynomial time algorithm, unbounded face, vertex-disjoint paths

Time: 2

Popis souboru: 155 bytes; text/html

Relation: [1] T. Bohman, A. M. Frieze, “Arc-disjoint Paths in Expander Digraphs,” SIAM Journal on Computing, vol. 32(2), pp. 326-344, 2003. [2] U. Brandes, G. Neyer and D. Wagner, “Edge-Disjoint Paths in Planar Graphs with Short Total Length,” Technical Report, Department of Computer and Information Science, University of Konstanz, 1996. [3] U. Brandes, D. Wagner, “A Linear Time Algorithm for the Arc Disjoint Menger Problem in Directed Planar Graphs,” Algorithmica, vol. 28(1), pp. 16-36, 2000. [4] A. Z. Broder, A. M. Frieze, S. Suen, E. Upfal, “An Efficient Algorithm for the Vertex-Disjoint Paths Problem in Random Graphs,” in Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 261-268, 1996. [5] A. Z. Broder, A. M. Frieze, S. Suen, E. Upfal, “Optimal Construction of Edge-Disjoint Paths in Random Graphs,” SIAM Journal on Computing, vol. 28(2), pp. 541-573, 1998. [6] W. T. Chan, F. Y. L. Chin, “Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids,” Journal of Algorithms, vol. 34(2), pp.337-369, 2000. [7] W. T. Chan, F. Y. L. Chin, H. F.Ting, “Escaping a Grid by Edge-Disjoint Paths,” Algorithmica, vol. 36(4), pp. 343-359, 2003. [8] C. Chekuri, S. Khanna, “Edge Disjoint Paths Revisited,” in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.628-637, 2003. [9] T. Erlebach and K. Jansen, “The Maximum Edge-Disjoint Paths Problem in Bidirected Trees,” SIAM Journal on Discrete Mathematics, vol.14(3), pp. 326-355, 2001. [10] A. Frank, T. Ibaraki, H. Nagamochi, “Two Arc-Disjoint Paths in Eulerian Digraphs,” SIAM Journal on Discrete Mathematics, vol. 11(4), pp. 557-589, 1998. [11] A. M. Frieze, “Edge-Disjoint Paths in Expander Graphs,” SIAM Journal on Computing, vol. 30(6), pp.1790-1801, 2000. [12] J. S. Fu, G. H. Chen, D. R. Duh, “Node-disjoint Paths and Related Problems on Hierarchical Cubic Networks,” Networks, vol. 40(3), pp. 142-154, 2002. [13] Q. P. Gu, S. Peng, “Algorithms for Node Disjoint Paths in Incomplete Star Networks,” in Proceedings of the 1994 International Conference on Parallel and Distributed Systems, pp. 296-303. [14] Q.P. Gu, S. Peng, “An Efficient Algorithm for k-Pairwise Disjoint Paths in Star Graphs,” Information Processing Letters, vol. 67(6), pp. 283-287, 1998. [15] Qian-Ping Gu, Shietung Peng, “An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes,” Journal of Parallel Distributed Computing, vol. 60(6), pp. 764-774, 2000. [16] Q. P. Gu, H. Tamaki, “Routing a Permutation in the Hypercube by Two Sets of Edge Disjoint Paths,” Journal of Parallel Distributed Computing, vol. 44(2), pp. 147-152, 1997. [17] V. Guruswami, S. Khanna, R. Rajaraman, F. B. Shepherd, M. Yannakakis, “Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems,” Journal of Computer and System Science, vol. 67(3), pp. 473-496, 2003. [18] H. V. D. Holst and J. C. D. Pina, “Length-Bounded Disjoint Paths in Planar Graphs,” Discrete Applied Mathematics, vol. 120, pp. 251-261, 2002. [19] S. Khuller, S. G. Mitchell, V. V. Vazirani, “Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem and for Finding a Kuratowski Homeomorph,” SIAM Journal on Computing, vol. 21(3), pp. 486-506, 1992. [20] K. Kaneko, Y. Suzuki, “Node-to-Node Internally Disjoint Paths Problem in Bubble-Sort Graphs,” in Proceedings of the 10th IEEE Pacific Rim International Symposium on Dependable Computing, pp. 173-182, 2004. [21] J. M. Kleinberg, É. Tardos, “Disjoint Paths in Densely Embedded Graphs,” in Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pp. 52-61, 1995. [22] J. M. Kleinberg, E. Tardos, “Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks,” Journal of Computer and System Science, vol. 57(1), pp. 61-73, 1998. [23] E. Korach, A. Tal, “General Vertex Disjoint Paths in Series-Parallel Graphs,” Discrete Applied Mathematics, vol. 41(2), pp. 147-164, 1993. [24] C. N. Lai, G. H. Chen, D. R. Duh, “Constructing One-to-Many Disjoint Paths in Folded Hypercubes,” IEEE Transactions on Computers, vol. 51(1), pp. 33-45, 2002. [25] C. Li, S. T. McCormick, D. Simchi-Levi, “The Complexity of Finding Paths with Min-Max Objective Function,” Discrete Applied Mathematics, vol. 26 pp. 105-115, 1990. [26] M. Middendorf, F. Pfeiffer, “On the complexity of the disjoint paths problems,” Combinatorica, vol. 13(1), pp. 97-107, 1993. [27] T. Nishizeki, J. Vygen, X. Zhou, “The edge-disjoint paths problem is NP-complete for series-parallel graphs,” Discrete Applied Mathematics, vol. 115(1-3), pp. 177-186, 2001. [28] H. Ripphausen-Lipa, D. Wagner and K. Weihe, “The Vertex-Disjoint Menger Problem in Planar Graphs,” SIAM Journal on Computing, vol. 26, pp. 331-349, 1997. [29] A. Schrijver, “Finding k Disjoint Paths in a Directed Planar Graph,” SIAM Journal on Computing, vol. 23, pp. 780-788, 1994. [30] A. Slivkins, “Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs,” in Proceedings of the 11th Annual European Symposium on Algorithms, pp. 482-493, 2003. [31] M. Y. Su, H. L. Huang, G. H. Chen, D. R. Duh, “Node-Disjoint paths in incomplete WK-recursive networks,” Parallel Computing, vol. 26(13-14):, pp. 1925-1944, 2000. [32] J. W. Suurballe and R.E. Tarjan, “A Quick Method for Finding Shortest Pairs of Disjoint Paths,” Networks, vol 14, pp. 325-336, 1984. [33] K. R. Varadarajan, G. Venkataraman, “Graph decomposition and a greedy algorithm for edge-disjoint paths,” in Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 379-380, 2004. [34] J. Vygen, “NP-completeness of some edge-disjoint paths problems,” Discrete Applied Mathematics, vol. 61, pp.83-90, 1995. [35] D. Wagner and K. Weihe, “A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs,” Combinatorica, vol 15 (1), pp. 135-150, 1995. [36] K. Weihe, ”Edge-Disjoint (s,t)-Paths in Undirected Planar Graphs in Linear Time,” Journal of Algorithms, vol. 23, pp. 121-138, 1997. [37] H. Yinnone, “Maximum Number of Disjoint Paths Connecting Specified Terminals in a Graph,” Discrete Applied Mathematics, vol. 55(2), pp. 183-195, 1994. [38] X. Zhou, S. Tamura, T. Nishizeki, “Finding Edge-Disjoint Paths in Partial k-Trees,” Algorithmica, vol. 26(1), pp. 3-30, 2000.; http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/34224

Dostupnost: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/34224