Catalogo Articoli (Spogli Riviste)

HELP
ATTENZIONE: attualmente gli articoli Current Contents (fonte ISI) a partire dall'anno 2002 sono consultabili sulla Risorsa On-Line

Le informazioni sugli articoli di fonte ISI sono coperte da copyright

La ricerca find articoli where soggetti phrase all words 'approximation algorithms' sort by level,fasc_key/DESCEND, pagina_ini_num/ASCEND ha restituito 345 riferimenti
Si mostrano 100 riferimenti a partire da 1
Selezionare un intervallo

Per ulteriori informazioni selezionare i riferimenti di interesse.

    1. Andrews, M; Bender, MA; Zhang, L
      New algorithms for disk scheduling

      ALGORITHMICA
    2. Goldreich, O; Ron, D
      Property testing in bounded degree graphs

      ALGORITHMICA
    3. Kwon, OH; Chwa, KY
      Approximation algorithms for general parallel task scheduling

      INFORMATION PROCESSING LETTERS
    4. Carr, R; Fujito, T; Konjevod, G; Parekh, O
      A 21/10-approximation algorithm for a generalization of the weighted edge-dominating set problem

      JOURNAL OF COMBINATORIAL OPTIMIZATION
    5. Gaur, DR; Krishnamurti, R
      Simple approximation algorithms for MAXNAESP and hypergraph 2-colorability

      JOURNAL OF COMBINATORIAL OPTIMIZATION
    6. Krysta, P; Solis-Oba, R
      Approximation algorithms for bounded facility location problems

      JOURNAL OF COMBINATORIAL OPTIMIZATION
    7. Prabhakaran, B
      Multimedia information delivery over wireless channels

      MULTIMEDIA TOOLS AND APPLICATIONS
    8. Das Gupta, B; Palis, MA
      Online real-time preemptive scheduling of jobs with deadlines on multiple machines

      JOURNAL OF SCHEDULING
    9. Leung, JYT; Dror, M; Young, GH
      A note on an open-end bin packing problem

      JOURNAL OF SCHEDULING
    10. Hoogeveen, H; Schuurman, P; Woeginger, GJ
      Non-approximability results for scheduling problems with minsum criteria

      INFORMS JOURNAL ON COMPUTING
    11. Liben-Nowell, D
      On the structure of syntenic distance

      JOURNAL OF COMPUTATIONAL BIOLOGY
    12. Salman, FS; Cheriyan, J; Ravi, R; Subramanian, S
      Approximating the single-sink link-installation problem in network design

      SIAM JOURNAL ON OPTIMIZATION
    13. Bullo, F; Lynch, KM
      Kinematic controllability for decoupled trajectory planning in underactuated mechanical systems

      IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION
    14. Krumke, SO; Marathe, MV; Ravi, SS
      Models and approximation algorithms for channel assignment in radio networks

      WIRELESS NETWORKS
    15. Mishra, S; Sikdar, K
      On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem

      RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS
    16. Robertson, AJ
      A set of greedy randomized Adaptive Local Search Procedure (GRASP) implementations for the multidimensional assignment problem

      COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
    17. Dhaenens-Flipo, C
      A bicriterion approach to deal with a constrained single-objective problem

      INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
    18. Erlebach, T; Jansen, K
      The maximum edge-disjoint paths problem in bidirected trees

      SIAM JOURNAL ON DISCRETE MATHEMATICS
    19. Kortsarz, G; Krauthgamer, R
      On approximating the achromatic number

      SIAM JOURNAL ON DISCRETE MATHEMATICS
    20. Cheriyan, J; Sebo, A; Szigeti, Z
      Improving on the 1.5-approximation of a smallest 2-edge connected spanningsubgraph

      SIAM JOURNAL ON DISCRETE MATHEMATICS
    21. Ageev, A; Hassin, R; Sviridenko, M
      A 0.5-approximation algorithm for MAX DICUT with given sizes of parts

      SIAM JOURNAL ON DISCRETE MATHEMATICS
    22. Crescenzi, P; Silvestri, R; Trevisan, L
      On weighted vs unweighted versions of combinatorial optimization problems

      INFORMATION AND COMPUTATION
    23. Libeskind-Hadas, R; Hartline, JRK; Boothe, P; Rae, G; Swisher, J
      On multicast algorithms for heterogeneous networks of workstations

      JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
    24. Azar, Y; Regev, O
      On-line bin-stretching

      THEORETICAL COMPUTER SCIENCE
    25. Chen, DH; Du, DZ; Hu, XD; Lin, GH; Wang, LS; Xue, GL
      Approximations for Steiner trees with minimum number of Steiner points

      THEORETICAL COMPUTER SCIENCE
    26. Janssen, J; Narayanan, L
      Approximation algorithms for channel assignment with constraints

      THEORETICAL COMPUTER SCIENCE
    27. Lin, GH; Xue, GL
      Signed genome rearrangement by reversals and transpositions: models and approximations

      THEORETICAL COMPUTER SCIENCE
    28. Bar-Ilan, J; Kortsarz, G; Peleg, D
      Generalized submodular cover problems and applications

      THEORETICAL COMPUTER SCIENCE
    29. LaValle, SM; Konkimalla, P
      Algorithms for computing numerical optimal feedback motion strategies

      INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH
    30. LaValle, SM; Kuffner, JJ
      Randomized kinodynamic planning

      INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH
    31. Zhu, BH; Poon, CK
      Efficient approximation algorithms for two-label point labeling

      INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS
    32. Arya, S; Cheng, SW; Mount, DM
      Approximation algorithm for multiple-tool milling

      INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS
    33. Andersson, G; Engebretsen, L; Hastad, J
      A new way of using semidefinite programming with applications to linear equations mod p

      JOURNAL OF ALGORITHMS
    34. Chandra, B; Halldorsson, MM
      Greedy local improvement and weighted set packing approximation

      JOURNAL OF ALGORITHMS
    35. Xue, G; Lin, GH; Du, DZ
      Grade of Service Steiner Minimum Trees in the Euclidean plane

      ALGORITHMICA
    36. Narayanan, L; Opatrny, J; Sotteau, D
      All-to-all optical routing in chordal rings of degree 4

      ALGORITHMICA
    37. Ravi, R; Marathe, MV; Ravi, SS; Rosenkrantz, DJ; Hunt, HB
      Approximation algorithms for degree-constrained minimum-cost network-design problems

      ALGORITHMICA
    38. Cheriyan, J; Jordan, T; Nutov, Z
      On rooted node-connectivity problems

      ALGORITHMICA
    39. Kumar, V
      An approximation algorithm for circular arc colouring

      ALGORITHMICA
    40. Gonzalez, TF
      Simple algorithms for multimessage multicasting with forwarding

      ALGORITHMICA
    41. Narayanan, L; Shende, SM
      Static frequency assignment in cellular networks

      ALGORITHMICA
    42. Feige, U; Kortsarz, G; Peleg, D
      The dense k-subgraph problem

      ALGORITHMICA
    43. Shachnai, H; Tamir, T
      On two class-constrained versions of the multiple knapsack problem

      ALGORITHMICA
    44. Bar-Noy, A; Guha, S; Naor, JS; Schieber, B
      Approximating the throughput of multiple machines in real-time scheduling

      SIAM JOURNAL ON COMPUTING
    45. Vadhan, SP
      The complexity of counting in sparse, regular, and planar graphs

      SIAM JOURNAL ON COMPUTING
    46. Naor, JS; Zosin, L
      A 2-approximation algorithm for the directed multiway cut problem

      SIAM JOURNAL ON COMPUTING
    47. Chekuri, C; Motwani, R; Natarajan, B; Stein, C
      Approximation techniques for average completion time scheduling

      SIAM JOURNAL ON COMPUTING
    48. Andreae, T
      On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality

      NETWORKS
    49. Helvig, CS; Robins, G; Zelikovsky, A
      An improved approximation scheme for the Group Steiner Problem

      NETWORKS
    50. Wang, GQ; Cheng, TCE
      Heuristics for two-machine no-wait flowshop scheduling with an availability constraint

      INFORMATION PROCESSING LETTERS
    51. Fujito, T
      On approximability of the independent/connected edge dominating set problems

      INFORMATION PROCESSING LETTERS
    52. Feige, U; Karpinski, M; Langberg, M
      A note on approximating Max-Bisection on regular graphs

      INFORMATION PROCESSING LETTERS
    53. Slaney, J; Thiebaux, S
      Blocks World revisited

      ARTIFICIAL INTELLIGENCE
    54. Hauptmeier, D; Krumke, SO; Rambau, J; Wirth, HC
      Euler is standing in line dial-a-ride problems with precedence-constraints

      DISCRETE APPLIED MATHEMATICS
    55. Kagaris, D; Tragoudas, S
      Computational analysis of counter-based schemes for VLSI test pattern generation

      DISCRETE APPLIED MATHEMATICS
    56. Tamir, A
      The k-centrum multi-facility location problem

      DISCRETE APPLIED MATHEMATICS
    57. Skutella, M
      Convex quadratic and semidefinite programming relaxations in scheduling

      JOURNAL OF THE ACM
    58. Jain, K; Vazirani, VV
      Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation

      JOURNAL OF THE ACM
    59. Dror, M; Haouari, M
      Generalized Steiner problems and other variants

      JOURNAL OF COMBINATORIAL OPTIMIZATION
    60. Berman, P; Dasgupta, B
      Multi-phase algorithms for throughput maximization for real-time scheduling

      JOURNAL OF COMBINATORIAL OPTIMIZATION
    61. Dawande, M; Kalagnanam, J; Keskinocak, P; Salman, FS; Ravi, R
      Approximation algorithms for the multiple knapsack problem with assignmentrestrictions

      JOURNAL OF COMBINATORIAL OPTIMIZATION
    62. Abdalla, M; Shavitt, Y; Wool, A
      Key management for restricted multicast using broadcast encryption

      IEEE-ACM TRANSACTIONS ON NETWORKING
    63. Tuy, H
      Monotonic optimization: Problems and solution approaches

      SIAM JOURNAL ON OPTIMIZATION
    64. Helmberg, C; Rendl, F
      A spectral bundle method for semidefinite programming

      SIAM JOURNAL ON OPTIMIZATION
    65. Barcaccia, P; Bonuccelli, MA; Di Ianni, M
      Complexity of minimum length scheduling for precedence constrained messages in distributed systems

      IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
    66. Spiteri, RJ; Pai, DK; Ascher, UM
      Programming and control of robots by means of differential algebraic inequalities

      IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION
    67. Bockenhauer, HJ; Seibert, S
      Improved lower bounds on the approximability of the Traveling Salesman Problem

      RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS
    68. Arya, S; Mount, DM
      Approximate range searching

      COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS
    69. Arkin, EM; Fekete, SP; Mitchell, JSB
      Approximation algorithms for lawn mowing and milling

      COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS
    70. Chen, DG; Du, DZ; Hu, XD; Lin, GH; Wang, LS; Xue, GL
      Approximations for Steiner trees with minimum number of Steiner points

      JOURNAL OF GLOBAL OPTIMIZATION
    71. Nagamochi, H
      Recent development of graph connectivity augmentation algorithms

      IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS
    72. Fujito, T
      Approximation algorithms for submodular set cover with applications

      IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS
    73. Hirata, T; Ono, T
      Approximation algorithms for MAX SAT

      IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS
    74. Funabiki, N; Higashino, T
      A minimal-state processing search algorithm for graph coloring problems

      IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
    75. Itoh, T
      Approximating the maximum weight of linear codes is APX-complete

      IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
    76. Nagamochi, H; Seki, K; Ibaraki, T
      A 7/3-approximation for the minimum weight 3-connected spanning subgraph problem

      IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
    77. Sima, J; Orponen, P; Antti-Poika, T
      On the computational complexity of binary and analog symmetric hopfield nets

      NEURAL COMPUTATION
    78. Coffman, EG; Courcoubetis, C; Garey, MR; Johnson, DS; Shor, PW; Weber, RR; Yannakakis, M
      Bin packing with discrete item sizes, part I: Perfect packing theorems andthe average case behavior of optimal packings

      SIAM JOURNAL ON DISCRETE MATHEMATICS
    79. Khuller, S; Sussmann, YJ
      The capacitated K-center problem

      SIAM JOURNAL ON DISCRETE MATHEMATICS
    80. Even, G; Naor, JS; Schieber, B; Zosin, L
      Approximating minimum subset feedback sets in undirected graphs with applications

      SIAM JOURNAL ON DISCRETE MATHEMATICS
    81. Bartal, Y; Leonardi, S; Marchetti-Spaccamela, A; Sgall, J; Stougie, L
      Multiprocessor scheduling with rejection

      SIAM JOURNAL ON DISCRETE MATHEMATICS
    82. Anstreicher, K; Wolkowicz, H
      Lagrangian relaxation of quadratic matrix constraints

      SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS
    83. Raz, D; Shavitt, Y
      Optimal partition of QoS requirements with discrete cost functions

      IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
    84. Baveja, A; Srinivasan, A
      Approximation algorithms for disjoint paths and related routing and packing problems

      MATHEMATICS OF OPERATIONS RESEARCH
    85. Lakshmanan, KB; Rosenkrantz, DJ; Ravi, SS
      Alarm placement in systems with fault propagation

      THEORETICAL COMPUTER SCIENCE
    86. Khuller, S; Pless, R; Sussmann, YJ
      Fault tolerant K-center problems

      THEORETICAL COMPUTER SCIENCE
    87. Blum, A; Konjevod, G; Ravi, R; Vempala, S
      Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems

      THEORETICAL COMPUTER SCIENCE
    88. Vazirani, VV
      Recent results on approximating the Steiner tree problem and its generalizations

      THEORETICAL COMPUTER SCIENCE
    89. Akutsu, T; Halldorsson, MM
      On the approximation of largest common subtrees and largest common point sets

      THEORETICAL COMPUTER SCIENCE
    90. Helvig, CS; Robins, G; Zelikovsky, A
      New approximation algorithms for routing with multiport terminals

      IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS
    91. Mandoiu, II; Vazirani, VV; Ganley, JL
      A new heuristic for rectilinear Steiner trees

      IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS
    92. Lopez, MA
      Efficient approximation of convex polygons

      INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS
    93. Guttmann-Beck, N; Hassin, R; Khuller, S; Raghavachari, B
      Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem

      ALGORITHMICA
    94. Heath, LS; Vergara, JPC
      Sorting by short block-moves

      ALGORITHMICA
    95. Trevisan, L
      Approximating satisfiable satisfiability problems

      ALGORITHMICA
    96. Eppstein, D
      Diameter and treewidth in minor-closed graph families

      ALGORITHMICA
    97. Bar-Yehuda, R
      One for the price of two: a unified approach for approximating covering problems

      ALGORITHMICA
    98. Schomer, E; Sellen, J; Teichmann, M; Yap, C
      Smallest enclosing cylinders

      ALGORITHMICA
    99. Guttmann-Beck, N; Hassin, R
      Approximation algorithms for minimum K-cut

      ALGORITHMICA
    100. Agarwal, PK; Wang, HY
      Approximation algorithms for curvature-constrained shortest paths

      SIAM JOURNAL ON COMPUTING


ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 14/08/20 alle ore 16:38:13