Si mostrano 100 riferimenti a partire da 1 |

Per ulteriori informazioni selezionare i riferimenti di interesse.

- Andrews, M; Bender, MA; Zhang, L

New algorithms for disk scheduling*ALGORITHMICA*

- Goldreich, O; Ron, D

Property testing in bounded degree graphs*ALGORITHMICA*

- Kwon, OH; Chwa, KY

Approximation algorithms for general parallel task scheduling*INFORMATION PROCESSING LETTERS*

- 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*

- Gaur, DR; Krishnamurti, R

Simple approximation algorithms for MAXNAESP and hypergraph 2-colorability*JOURNAL OF COMBINATORIAL OPTIMIZATION*

- Krysta, P; Solis-Oba, R

Approximation algorithms for bounded facility location problems*JOURNAL OF COMBINATORIAL OPTIMIZATION*

- Prabhakaran, B

Multimedia information delivery over wireless channels*MULTIMEDIA TOOLS AND APPLICATIONS*

- Das Gupta, B; Palis, MA

Online real-time preemptive scheduling of jobs with deadlines on multiple machines*JOURNAL OF SCHEDULING*

- Leung, JYT; Dror, M; Young, GH

A note on an open-end bin packing problem*JOURNAL OF SCHEDULING*

- Hoogeveen, H; Schuurman, P; Woeginger, GJ

Non-approximability results for scheduling problems with minsum criteria*INFORMS JOURNAL ON COMPUTING*

- Liben-Nowell, D

On the structure of syntenic distance*JOURNAL OF COMPUTATIONAL BIOLOGY*

- Salman, FS; Cheriyan, J; Ravi, R; Subramanian, S

Approximating the single-sink link-installation problem in network design*SIAM JOURNAL ON OPTIMIZATION*

- Bullo, F; Lynch, KM

Kinematic controllability for decoupled trajectory planning in underactuated mechanical systems*IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION*

- Krumke, SO; Marathe, MV; Ravi, SS

Models and approximation algorithms for channel assignment in radio networks*WIRELESS NETWORKS*

- 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*

- Robertson, AJ

A set of greedy randomized Adaptive Local Search Procedure (GRASP) implementations for the multidimensional assignment problem*COMPUTATIONAL OPTIMIZATION AND APPLICATIONS*

- Dhaenens-Flipo, C

A bicriterion approach to deal with a constrained single-objective problem*INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS*

- Erlebach, T; Jansen, K

The maximum edge-disjoint paths problem in bidirected trees*SIAM JOURNAL ON DISCRETE MATHEMATICS*

- Kortsarz, G; Krauthgamer, R

On approximating the achromatic number*SIAM JOURNAL ON DISCRETE MATHEMATICS*

- Cheriyan, J; Sebo, A; Szigeti, Z

Improving on the 1.5-approximation of a smallest 2-edge connected spanningsubgraph*SIAM JOURNAL ON DISCRETE MATHEMATICS*

- Ageev, A; Hassin, R; Sviridenko, M

A 0.5-approximation algorithm for MAX DICUT with given sizes of parts*SIAM JOURNAL ON DISCRETE MATHEMATICS*

- Crescenzi, P; Silvestri, R; Trevisan, L

On weighted vs unweighted versions of combinatorial optimization problems*INFORMATION AND COMPUTATION*

- 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*

- Azar, Y; Regev, O

On-line bin-stretching*THEORETICAL COMPUTER SCIENCE*

- 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*

- Janssen, J; Narayanan, L

Approximation algorithms for channel assignment with constraints*THEORETICAL COMPUTER SCIENCE*

- Lin, GH; Xue, GL

Signed genome rearrangement by reversals and transpositions: models and approximations*THEORETICAL COMPUTER SCIENCE*

- Bar-Ilan, J; Kortsarz, G; Peleg, D

Generalized submodular cover problems and applications*THEORETICAL COMPUTER SCIENCE*

- LaValle, SM; Konkimalla, P

Algorithms for computing numerical optimal feedback motion strategies*INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH*

- LaValle, SM; Kuffner, JJ

Randomized kinodynamic planning*INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH*

- Zhu, BH; Poon, CK

Efficient approximation algorithms for two-label point labeling*INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS*

- Arya, S; Cheng, SW; Mount, DM

Approximation algorithm for multiple-tool milling*INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS*

- Andersson, G; Engebretsen, L; Hastad, J

A new way of using semidefinite programming with applications to linear equations mod p*JOURNAL OF ALGORITHMS*

- Chandra, B; Halldorsson, MM

Greedy local improvement and weighted set packing approximation*JOURNAL OF ALGORITHMS*

- Xue, G; Lin, GH; Du, DZ

Grade of Service Steiner Minimum Trees in the Euclidean plane*ALGORITHMICA*

- Narayanan, L; Opatrny, J; Sotteau, D

All-to-all optical routing in chordal rings of degree 4*ALGORITHMICA*

- Ravi, R; Marathe, MV; Ravi, SS; Rosenkrantz, DJ; Hunt, HB

Approximation algorithms for degree-constrained minimum-cost network-design problems*ALGORITHMICA*

- Cheriyan, J; Jordan, T; Nutov, Z

On rooted node-connectivity problems*ALGORITHMICA*

- Kumar, V

An approximation algorithm for circular arc colouring*ALGORITHMICA*

- Gonzalez, TF

Simple algorithms for multimessage multicasting with forwarding*ALGORITHMICA*

- Narayanan, L; Shende, SM

Static frequency assignment in cellular networks*ALGORITHMICA*

- Feige, U; Kortsarz, G; Peleg, D

The dense k-subgraph problem*ALGORITHMICA*

- Shachnai, H; Tamir, T

On two class-constrained versions of the multiple knapsack problem*ALGORITHMICA*

- Bar-Noy, A; Guha, S; Naor, JS; Schieber, B

Approximating the throughput of multiple machines in real-time scheduling*SIAM JOURNAL ON COMPUTING*

- Vadhan, SP

The complexity of counting in sparse, regular, and planar graphs*SIAM JOURNAL ON COMPUTING*

- Naor, JS; Zosin, L

A 2-approximation algorithm for the directed multiway cut problem*SIAM JOURNAL ON COMPUTING*

- Chekuri, C; Motwani, R; Natarajan, B; Stein, C

Approximation techniques for average completion time scheduling*SIAM JOURNAL ON COMPUTING*

- Andreae, T

On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality*NETWORKS*

- Helvig, CS; Robins, G; Zelikovsky, A

An improved approximation scheme for the Group Steiner Problem*NETWORKS*

- Wang, GQ; Cheng, TCE

Heuristics for two-machine no-wait flowshop scheduling with an availability constraint*INFORMATION PROCESSING LETTERS*

- Fujito, T

On approximability of the independent/connected edge dominating set problems*INFORMATION PROCESSING LETTERS*

- Feige, U; Karpinski, M; Langberg, M

A note on approximating Max-Bisection on regular graphs*INFORMATION PROCESSING LETTERS*

- Slaney, J; Thiebaux, S

Blocks World revisited*ARTIFICIAL INTELLIGENCE*

- Hauptmeier, D; Krumke, SO; Rambau, J; Wirth, HC

Euler is standing in line dial-a-ride problems with precedence-constraints*DISCRETE APPLIED MATHEMATICS*

- Kagaris, D; Tragoudas, S

Computational analysis of counter-based schemes for VLSI test pattern generation*DISCRETE APPLIED MATHEMATICS*

- Tamir, A

The k-centrum multi-facility location problem*DISCRETE APPLIED MATHEMATICS*

- Skutella, M

Convex quadratic and semidefinite programming relaxations in scheduling*JOURNAL OF THE ACM*

- 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*

- Dror, M; Haouari, M

Generalized Steiner problems and other variants*JOURNAL OF COMBINATORIAL OPTIMIZATION*

- Berman, P; Dasgupta, B

Multi-phase algorithms for throughput maximization for real-time scheduling*JOURNAL OF COMBINATORIAL OPTIMIZATION*

- Dawande, M; Kalagnanam, J; Keskinocak, P; Salman, FS; Ravi, R

Approximation algorithms for the multiple knapsack problem with assignmentrestrictions*JOURNAL OF COMBINATORIAL OPTIMIZATION*

- Abdalla, M; Shavitt, Y; Wool, A

Key management for restricted multicast using broadcast encryption*IEEE-ACM TRANSACTIONS ON NETWORKING*

- Tuy, H

Monotonic optimization: Problems and solution approaches*SIAM JOURNAL ON OPTIMIZATION*

- Helmberg, C; Rendl, F

A spectral bundle method for semidefinite programming*SIAM JOURNAL ON OPTIMIZATION*

- 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*

- Spiteri, RJ; Pai, DK; Ascher, UM

Programming and control of robots by means of differential algebraic inequalities*IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION*

- Bockenhauer, HJ; Seibert, S

Improved lower bounds on the approximability of the Traveling Salesman Problem*RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS*

- Arya, S; Mount, DM

Approximate range searching*COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS*

- Arkin, EM; Fekete, SP; Mitchell, JSB

Approximation algorithms for lawn mowing and milling*COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS*

- 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*

- Nagamochi, H

Recent development of graph connectivity augmentation algorithms*IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS*

- Fujito, T

Approximation algorithms for submodular set cover with applications*IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS*

- Hirata, T; Ono, T

Approximation algorithms for MAX SAT*IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS*

- Funabiki, N; Higashino, T

A minimal-state processing search algorithm for graph coloring problems*IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES*

- Itoh, T

Approximating the maximum weight of linear codes is APX-complete*IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES*

- 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*

- Sima, J; Orponen, P; Antti-Poika, T

On the computational complexity of binary and analog symmetric hopfield nets*NEURAL COMPUTATION*

- 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*

- Khuller, S; Sussmann, YJ

The capacitated K-center problem*SIAM JOURNAL ON DISCRETE MATHEMATICS*

- Even, G; Naor, JS; Schieber, B; Zosin, L

Approximating minimum subset feedback sets in undirected graphs with applications*SIAM JOURNAL ON DISCRETE MATHEMATICS*

- Bartal, Y; Leonardi, S; Marchetti-Spaccamela, A; Sgall, J; Stougie, L

Multiprocessor scheduling with rejection*SIAM JOURNAL ON DISCRETE MATHEMATICS*

- Anstreicher, K; Wolkowicz, H

Lagrangian relaxation of quadratic matrix constraints*SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS*

- Raz, D; Shavitt, Y

Optimal partition of QoS requirements with discrete cost functions*IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS*

- Baveja, A; Srinivasan, A

Approximation algorithms for disjoint paths and related routing and packing problems*MATHEMATICS OF OPERATIONS RESEARCH*

- Lakshmanan, KB; Rosenkrantz, DJ; Ravi, SS

Alarm placement in systems with fault propagation*THEORETICAL COMPUTER SCIENCE*

- Khuller, S; Pless, R; Sussmann, YJ

Fault tolerant K-center problems*THEORETICAL COMPUTER SCIENCE*

- Blum, A; Konjevod, G; Ravi, R; Vempala, S

Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems*THEORETICAL COMPUTER SCIENCE*

- Vazirani, VV

Recent results on approximating the Steiner tree problem and its generalizations*THEORETICAL COMPUTER SCIENCE*

- Akutsu, T; Halldorsson, MM

On the approximation of largest common subtrees and largest common point sets*THEORETICAL COMPUTER SCIENCE*

- 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*

- Mandoiu, II; Vazirani, VV; Ganley, JL

A new heuristic for rectilinear Steiner trees*IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS*

- Lopez, MA

Efficient approximation of convex polygons*INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS*

- Guttmann-Beck, N; Hassin, R; Khuller, S; Raghavachari, B

Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem*ALGORITHMICA*

- Heath, LS; Vergara, JPC

Sorting by short block-moves*ALGORITHMICA*

- Trevisan, L

Approximating satisfiable satisfiability problems*ALGORITHMICA*

- Eppstein, D

Diameter and treewidth in minor-closed graph families*ALGORITHMICA*

- Bar-Yehuda, R

One for the price of two: a unified approach for approximating covering problems*ALGORITHMICA*

- Schomer, E; Sellen, J; Teichmann, M; Yap, C

Smallest enclosing cylinders*ALGORITHMICA*

- Guttmann-Beck, N; Hassin, R

Approximation algorithms for minimum K-cut*ALGORITHMICA*

- 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