Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Approximation Algorithms for Combinatorial Optimization [[electronic resource] ] : Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings / / edited by Klaus Jansen, Samir Khuller
| Approximation Algorithms for Combinatorial Optimization [[electronic resource] ] : Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings / / edited by Klaus Jansen, Samir Khuller |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (X, 282 p.) |
| Disciplina | 004/.01/5114 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer programming
Data structures (Computer science) Application software Algorithms Computer graphics Programming Techniques Data Structures and Information Theory Computer Applications Algorithm Analysis and Problem Complexity Data Structures Computer Graphics |
| ISBN | 3-540-44436-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Approximation Algorithms That Take Advice -- Instant Recognition of Polynomial Time Solvability, Half Integrality, and 2-Approximations -- Scheduling under Uncertainty: Optimizing against a Randomizing Adversary -- Approximation Algorithms for Facility Location Problems -- Contributed Talks -- An Approximation Algorithm for MAX DICUT with Given Sizes of Parts -- Maximizing Job Benefits On-Line -- Variable Length Sequencing with Two Lengths -- Randomized Path Coloring on Binary Trees -- Wavelength Rerouting in Optical Networks, or the Venetian Routing Problem -- Greedy Approximation Algorithms for Finding Dense Components in a Graph -- Online Real-Time Preemptive Scheduling of Jobs with Deadlines -- On the Relative Complexity of Approximate Counting Problems -- On the Hardness of Approximating NP Witnesses -- Maximum Dispersion and Geometric Maximum Weight Cliques -- New Results for Online Page Replication -- Inapproximability Results for Set Splitting and Satisfiability Problems with No Mixed Clauses -- Approximation Algorithms for a Capacitated Network Design Problem -- An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem -- Improved Approximations for Tour and Tree Covers -- Approximating Node Connectivity Problems via Set Covers -- Rectangle Tiling -- Primal-Dual Approaches to the Steiner Problem -- On the Inapproximability of Broadcasting Time -- Polynomial Time Approximation Schemes for Class-Constrained Packing Problems -- Partial Servicing of On-Line Jobs -- Factor 4/3 Approximations for Minimum 2-Connected Subgraphs. |
| Record Nr. | UNISA-996466354803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Approximation Algorithms for Combinatorial Optimization : Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings / / edited by Klaus Jansen, Samir Khuller
| Approximation Algorithms for Combinatorial Optimization : Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings / / edited by Klaus Jansen, Samir Khuller |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (X, 282 p.) |
| Disciplina | 004/.01/5114 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer programming
Data structures (Computer science) Information theory Application software Algorithms Artificial intelligence—Data processing Computer graphics Programming Techniques Data Structures and Information Theory Computer and Information Systems Applications Data Science Computer Graphics |
| ISBN | 3-540-44436-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Approximation Algorithms That Take Advice -- Instant Recognition of Polynomial Time Solvability, Half Integrality, and 2-Approximations -- Scheduling under Uncertainty: Optimizing against a Randomizing Adversary -- Approximation Algorithms for Facility Location Problems -- Contributed Talks -- An Approximation Algorithm for MAX DICUT with Given Sizes of Parts -- Maximizing Job Benefits On-Line -- Variable Length Sequencing with Two Lengths -- Randomized Path Coloring on Binary Trees -- Wavelength Rerouting in Optical Networks, or the Venetian Routing Problem -- Greedy Approximation Algorithms for Finding Dense Components in a Graph -- Online Real-Time Preemptive Scheduling of Jobs with Deadlines -- On the Relative Complexity of Approximate Counting Problems -- On the Hardness of Approximating NP Witnesses -- Maximum Dispersion and Geometric Maximum Weight Cliques -- New Results for Online Page Replication -- Inapproximability Results for Set Splitting and Satisfiability Problems with No Mixed Clauses -- Approximation Algorithms for a Capacitated Network Design Problem -- An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem -- Improved Approximations for Tour and Tree Covers -- Approximating Node Connectivity Problems via Set Covers -- Rectangle Tiling -- Primal-Dual Approaches to the Steiner Problem -- On the Inapproximability of Broadcasting Time -- Polynomial Time Approximation Schemes for Class-Constrained Packing Problems -- Partial Servicing of On-Line Jobs -- Factor 4/3 Approximations for Minimum 2-Connected Subgraphs. |
| Record Nr. | UNINA-9910143618403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
STOC '21 : proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing : June 21-25, 2021, Virtual, Italy / / Samir Khuller, Virginia Vassilevska Williams, editors
| STOC '21 : proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing : June 21-25, 2021, Virtual, Italy / / Samir Khuller, Virginia Vassilevska Williams, editors |
| Pubbl/distr/stampa | New York, NY : , : Association for Computing Machinery, , 2021 |
| Descrizione fisica | 1 online resource : illustrations |
| Disciplina | 511.3 |
| Soggetto topico | Computational complexity |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910510492503321 |
| New York, NY : , : Association for Computing Machinery, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||