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.
Algorithmic Aspects of Wireless Sensor Networks [[electronic resource] ] : Second International Workshop, ALGOSENSORS 2006, Venice, Italy, July 15, 2006, Revised Selected Papers / / edited by Sotiris Nikoletseas, José D.P. Rolim
| Algorithmic Aspects of Wireless Sensor Networks [[electronic resource] ] : Second International Workshop, ALGOSENSORS 2006, Venice, Italy, July 15, 2006, Revised Selected Papers / / edited by Sotiris Nikoletseas, José D.P. Rolim |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (X, 222 p.) |
| Disciplina | 681/.2 |
| Collana | Computer Communication Networks and Telecommunications |
| Soggetto topico |
Computer communication systems
Algorithms Data structures (Computer science) Computer science—Mathematics Computer Communication Networks Algorithm Analysis and Problem Complexity Data Structures Discrete Mathematics in Computer Science |
| ISBN | 3-540-69087-5 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Regular Papers -- Efficient Training of Sensor Networks -- On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks -- A Context Interpretation Based Wireless Sensor Network for the Emergency Preparedness Class of Applications -- Adaptive Initialization Algorithm for Ad Hoc Radio Networks with Carrier Sensing -- Securing Communication Trees in Sensor Networks -- Self-deployment Algorithms for Mobile Sensors on a Ring -- Minimizing Interference of a Wireless Ad-Hoc Network in a Plane -- Self-stabilizing Weight-Based Clustering Algorithm for Ad Hoc Sensor Networks -- Improved Stretch Factor for Bounded-Degree Planar Power Spanners of Wireless Ad-Hoc Networks -- Wireless Communication in Random Geometric Topologies -- Localization Algorithm for Wireless Ad-Hoc Sensor Networks with Traffic Overhead Minimization by Emission Inhibition -- The Threshold Behaviour of the Fixed Radius Random Graph Model and Applications to the Key Management Problem of Sensor Networks -- Area Based Beaconless Reliable Broadcasting in Sensor Networks -- A Flexible Algorithm for Sensor Network Partitioning and Self-partitioning Problems -- Computing Bridges, Articulations, and 2-Connected Components in Wireless Sensor Networks -- Short Papers -- Uniquely Localizable Networks with Few Anchors -- A Locating Method for Ubiquitous Robots Based on Wireless Sensor Networks -- Declarative Resource Naming for Macroprogramming Wireless Networks of Embedded Systems -- Equalizing Sensor Energy and Maximising Sensor Network Lifespan Using RETT -- On the Information Flow Required for Tracking Control in Networks of Mobile Sensing Agents. |
| Record Nr. | UNISA-996466023203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques [[electronic resource] ] : 8th International Workshop on Approximation Algorithms for Compinatorial Optimization Problems, APPROX 2005 and 9th International Workshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings / / edited by Chandra Chekuri, Klaus Jansen, José D.P. Rolim, Luca Trevisan
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques [[electronic resource] ] : 8th International Workshop on Approximation Algorithms for Compinatorial Optimization Problems, APPROX 2005 and 9th International Workshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings / / edited by Chandra Chekuri, Klaus Jansen, José D.P. Rolim, Luca Trevisan |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XI, 495 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Numerical analysis Computer science—Mathematics Discrete mathematics Numerical Analysis Discrete Mathematics in Computer Science |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Contributed Talks of APPROX -- The Network as a Storage Device: Dynamic Routing with Bounded Buffers -- Rounding Two and Three Dimensional Solutions of the SDP Relaxation of MAX CUT -- What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs -- A Rounding Algorithm for Approximating Minimum Manhattan Networks -- Packing Element-Disjoint Steiner Trees -- Approximating the Bandwidth of Caterpillars -- Where’s the Winner? Max-Finding and Sorting with Metric Costs -- What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization -- The Complexity of Making Unique Choices: Approximating 1-in-k SAT -- Approximating the Distortion -- Approximating the Best-Fit Tree Under L p Norms -- Beating a Random Assignment -- Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints -- Approximation Algorithms for Network Design and Facility Location with Service Capacities -- Finding Graph Matchings in Data Streams -- A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses -- Efficient Approximation of Convex Recolorings -- Approximation Algorithms for Requirement Cut on Graphs -- Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems -- Towards Optimal Integrality Gaps for Hypergraph Vertex Cover in the Lovász-Schrijver Hierarchy -- Contributed Talks of RANDOM -- Bounds for Error Reduction with Few Quantum Queries -- Sampling Bounds for Stochastic Optimization -- An Improved Analysis of Mergers -- Finding a Maximum Independent Set in a Sparse Random Graph -- On the Error Parameter of Dispersers -- Tolerant Locally Testable Codes -- A Lower Bound on List Size for List Decoding -- A Lower Bound for Distribution-Free Monotonicity Testing -- On Learning Random DNF Formulas Under the Uniform Distribution -- Derandomized Constructions of k-Wise (Almost) Independent Permutations -- Testing Periodicity -- The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem -- The Online Clique Avoidance Game on Random Graphs -- A Generating Function Method for the Average-Case Analysis of DPLL -- A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas -- Mixing Points on a Circle -- Derandomized Squaring of Graphs -- Tight Bounds for String Reconstruction Using Substring Queries -- Reconstructive Dispersers and Hitting Set Generators -- The Tensor Product of Two Codes Is Not Necessarily Robustly Testable -- Fractional Decompositions of Dense Hypergraphs. |
| Record Nr. | UNISA-996465925803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques [[electronic resource] ] : 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013, Proceedings / / edited by Prasad Raghavendra, Sofya Raskhodnikova, Klaus Jansen, José D.P. Rolim
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques [[electronic resource] ] : 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013, Proceedings / / edited by Prasad Raghavendra, Sofya Raskhodnikova, Klaus Jansen, José D.P. Rolim |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XIV, 716 p. 48 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer science Numerical analysis Mathematical statistics Artificial intelligence—Data processing Discrete Mathematics in Computer Science Theory of Computation Numerical Analysis Probability and Statistics in Computer Science Data Science |
| ISBN | 3-642-40328-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Spectral Sparsification in Dynamic Graph Streams -- The Online Stochastic Generalized Assignment Problem -- On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems -- Approximating Large Frequency Moments with Pick-and-Drop Sampling -- Generalizing the Layering Method of Indyk and Woodruff: Recursive Sketches for Frequency-Based Vectors on Streams -- Capacitated Network Design on Undirected Graphs -- Scheduling Subset Tests: One-Time, Continuous, and How They Relate -- On the Total Perimeter of Homothetic Convex Bodies in a Convex Container -- Partial Interval Set Cover – Trade-Offs between Scalability and Optimality -- Online Square-into-Square Packing -- Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions -- Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems -- Multiple Traveling Salesmen in Asymmetric Metrics -- Approximate Indexability and Bandit Problems with Concave Rewards and Delayed Feedback -- The Approximability of the Binary Paintshop Problem -- Approximation Algorithms for Movement Repairmen -- Improved Hardness of Approximating Chromatic Number -- A Pseudo-approximation for the Genus of Hamiltonian Graphs -- A Local Computation Approximation Scheme to Maximum Matching -- Sketching Earth-Mover Distance on Graph Metrics -- Online Multidimensional Load Balancing -- A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs -- Interdiction Problems on Planar Graphs -- Conditional Random Fields, Planted Constraint Satisfaction and Entropy Concentration -- Finding Heavy Hitters from Lossy or Noisy Data -- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy -- Phase Coexistence and Slow Mixing for the Hard-Core Model on Z2 -- Fast Private Data Release Algorithms for Sparse Queries -- Local Reconstructors and Tolerant Testers for Connectivity and Diameter -- An Optimal Lower Bound for Monotonicity Testing over Hypergrids -- Small-Bias Sets for Nonabelian Groups: Derandomizations of the Alon-Roichman Theorem -- What You Can Do with Coordinated Samples -- Robust Randomness Amplifiers: Upper and Lower Bounds -- The Power of Choice for Random Satisfiability -- Connectivity of Random High Dimensional Geometric Graphs -- Matching-Vector Families and LDCs over Large Modulo -- Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing -- Testing Membership in Counter Automaton Languages -- Tight Lower Bounds for Testing Linear Isomorphism -- Randomness-Efficient Curve Samplers -- Combinatorial Limitations of Average-Radius List Decoding -- Zero Knowledge LTCs and Their Applications -- A Tight Lower Bound for High Frequency Moment Estimation with Small Error -- Improved FPTAS for Multi-spin Systems -- Pseudorandomness for Regular Branching Programs via Fourier Analysis -- Absolutely Sound Testing of Lifted Codes -- On the Average Sensitivity and Density of k-CNF Formulas -- Improved Bounds on the Phase Transition for the Hard-Core Model in 2-Dimensions. |
| Record Nr. | UNISA-996465703803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013, Proceedings / / edited by Prasad Raghavendra, Sofya Raskhodnikova, Klaus Jansen, José D.P. Rolim
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013, Proceedings / / edited by Prasad Raghavendra, Sofya Raskhodnikova, Klaus Jansen, José D.P. Rolim |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XIV, 716 p. 48 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer science Numerical analysis Mathematical statistics Artificial intelligence—Data processing Discrete Mathematics in Computer Science Theory of Computation Numerical Analysis Probability and Statistics in Computer Science Data Science |
| ISBN | 3-642-40328-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Spectral Sparsification in Dynamic Graph Streams -- The Online Stochastic Generalized Assignment Problem -- On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems -- Approximating Large Frequency Moments with Pick-and-Drop Sampling -- Generalizing the Layering Method of Indyk and Woodruff: Recursive Sketches for Frequency-Based Vectors on Streams -- Capacitated Network Design on Undirected Graphs -- Scheduling Subset Tests: One-Time, Continuous, and How They Relate -- On the Total Perimeter of Homothetic Convex Bodies in a Convex Container -- Partial Interval Set Cover – Trade-Offs between Scalability and Optimality -- Online Square-into-Square Packing -- Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions -- Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems -- Multiple Traveling Salesmen in Asymmetric Metrics -- Approximate Indexability and Bandit Problems with Concave Rewards and Delayed Feedback -- The Approximability of the Binary Paintshop Problem -- Approximation Algorithms for Movement Repairmen -- Improved Hardness of Approximating Chromatic Number -- A Pseudo-approximation for the Genus of Hamiltonian Graphs -- A Local Computation Approximation Scheme to Maximum Matching -- Sketching Earth-Mover Distance on Graph Metrics -- Online Multidimensional Load Balancing -- A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs -- Interdiction Problems on Planar Graphs -- Conditional Random Fields, Planted Constraint Satisfaction and Entropy Concentration -- Finding Heavy Hitters from Lossy or Noisy Data -- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy -- Phase Coexistence and Slow Mixing for the Hard-Core Model on Z2 -- Fast Private Data Release Algorithms for Sparse Queries -- Local Reconstructors and Tolerant Testers for Connectivity and Diameter -- An Optimal Lower Bound for Monotonicity Testing over Hypergrids -- Small-Bias Sets for Nonabelian Groups: Derandomizations of the Alon-Roichman Theorem -- What You Can Do with Coordinated Samples -- Robust Randomness Amplifiers: Upper and Lower Bounds -- The Power of Choice for Random Satisfiability -- Connectivity of Random High Dimensional Geometric Graphs -- Matching-Vector Families and LDCs over Large Modulo -- Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing -- Testing Membership in Counter Automaton Languages -- Tight Lower Bounds for Testing Linear Isomorphism -- Randomness-Efficient Curve Samplers -- Combinatorial Limitations of Average-Radius List Decoding -- Zero Knowledge LTCs and Their Applications -- A Tight Lower Bound for High Frequency Moment Estimation with Small Error -- Improved FPTAS for Multi-spin Systems -- Pseudorandomness for Regular Branching Programs via Fourier Analysis -- Absolutely Sound Testing of Lifted Codes -- On the Average Sensitivity and Density of k-CNF Formulas -- Improved Bounds on the Phase Transition for the Hard-Core Model in 2-Dimensions. |
| Record Nr. | UNINA-9910484349103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques [[electronic resource] ] : 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012, Proceedings / / edited by Anupam Gupta, Klaus Jansen, José D.P. Rolim, ROCCO SERVEDIO
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques [[electronic resource] ] : 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012, Proceedings / / edited by Anupam Gupta, Klaus Jansen, José D.P. Rolim, ROCCO SERVEDIO |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XV, 674 p. 21 illus.) |
| Disciplina | 519.6/4 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer science Numerical analysis Mathematical statistics Image processing—Digital techniques Computer vision Discrete Mathematics in Computer Science Theory of Computation Numerical Analysis Probability and Statistics in Computer Science Computer Imaging, Vision, Pattern Recognition and Graphics |
| ISBN | 3-642-32512-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465431203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques [[electronic resource] ] : 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011, Proceedings / / edited by Leslie Ann Goldberg, Klaus Jansen, R. Ravi, José D.P. Rolim
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques [[electronic resource] ] : 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011, Proceedings / / edited by Leslie Ann Goldberg, Klaus Jansen, R. Ravi, José D.P. Rolim |
| Edizione | [1st ed. 2011.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
| Descrizione fisica | 1 online resource (XV, 702 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Computer science Computer graphics Computer networks Discrete Mathematics in Computer Science Data Science Theory of Computation Computer Graphics Computer Communication Networks |
| ISBN | 3-642-22935-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | New tools for graph coloring / Sanjeev Arora, Rong Ge -- Inapproximability of NP-complete variants of Nash equilibrium / Per Austrin, Mark Braverman, Eden Chlamtáč. |
| Record Nr. | UNISA-996466063803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques [[electronic resource] ] : 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings / / edited by Moses Charikar, Klaus Jansen, Omer Reingold, José D.P. Rolim
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques [[electronic resource] ] : 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings / / edited by Moses Charikar, Klaus Jansen, Omer Reingold, José D.P. Rolim |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XII, 628 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Algorithms Computer science—Mathematics Discrete mathematics Numerical analysis Software Engineering Discrete Mathematics in Computer Science Numerical Analysis |
| ISBN | 3-540-74208-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Contributed Talks of APPROX -- Approximation Algorithms and Hardness for Domination with Propagation -- A Knapsack Secretary Problem with Applications -- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem -- Improved Approximation Algorithms for the Spanning Star Forest Problem -- Packing and Covering ?-Hyperbolic Spaces by Balls -- Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems -- Two Randomized Mechanisms for Combinatorial Auctions -- Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs -- Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows -- Stochastic Steiner Tree with Non-uniform Inflation -- On the Approximation Resistance of a Random Predicate -- Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to ?1 Embeddability of Negative Type Metrics -- Optimal Resource Augmentations for Online Knapsack -- Soft Edge Coloring -- Approximation Algorithms for the Max-Min Allocation Problem -- Hardness of Embedding Metric Spaces of Equal Size -- Coarse Differentiation and Multi-flows in Planar Graphs -- Maximum Gradient Embeddings and Monotone Clustering -- Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems -- Encouraging Cooperation in Sharing Supermodular Costs -- Almost Exact Matchings -- Contributed Talks of RANDOM -- On Approximating the Average Distance Between Points -- On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR -- A Sequential Algorithm for Generating Random Graphs -- Local Limit Theorems for the Giant Component of Random Hypergraphs -- Derandomization of Euclidean Random Walks -- High Entropy Random Selection Protocols -- Testing st-Connectivity -- Properly 2-Colouring Linear Hypergraphs -- Random Subsets of the Interval and P2P Protocols -- The Cover Time of Random Digraphs -- Eigenvectors of Random Graphs: Nodal Domains -- Lower Bounds for Swapping Arthur and Merlin -- Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects -- On Estimating Frequency Moments of Data Streams -- Distribution-Free Testing Lower Bounds for Basic Boolean Functions -- On the Randomness Complexity of Property Testing -- On the Benefits of Adaptivity in Property Testing of Dense Graphs -- Slow Mixing of Markov Chains Using Fault Lines and Fat Contours -- Better Binary List-Decodable Codes Via Multilevel Concatenation -- Worst-Case to Average-Case Reductions Revisited -- On Finding Frequent Elements in a Data Stream -- Implementing Huge Sparse Random Graphs -- Sublinear Algorithms for Approximating String Compressibility. |
| Record Nr. | UNISA-996466075303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings / / edited by Moses Charikar, Klaus Jansen, Omer Reingold, José D.P. Rolim
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings / / edited by Moses Charikar, Klaus Jansen, Omer Reingold, José D.P. Rolim |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XII, 628 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Algorithms Computer science—Mathematics Discrete mathematics Numerical analysis Software Engineering Discrete Mathematics in Computer Science Numerical Analysis |
| ISBN | 3-540-74208-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Contributed Talks of APPROX -- Approximation Algorithms and Hardness for Domination with Propagation -- A Knapsack Secretary Problem with Applications -- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem -- Improved Approximation Algorithms for the Spanning Star Forest Problem -- Packing and Covering ?-Hyperbolic Spaces by Balls -- Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems -- Two Randomized Mechanisms for Combinatorial Auctions -- Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs -- Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows -- Stochastic Steiner Tree with Non-uniform Inflation -- On the Approximation Resistance of a Random Predicate -- Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to ?1 Embeddability of Negative Type Metrics -- Optimal Resource Augmentations for Online Knapsack -- Soft Edge Coloring -- Approximation Algorithms for the Max-Min Allocation Problem -- Hardness of Embedding Metric Spaces of Equal Size -- Coarse Differentiation and Multi-flows in Planar Graphs -- Maximum Gradient Embeddings and Monotone Clustering -- Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems -- Encouraging Cooperation in Sharing Supermodular Costs -- Almost Exact Matchings -- Contributed Talks of RANDOM -- On Approximating the Average Distance Between Points -- On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR -- A Sequential Algorithm for Generating Random Graphs -- Local Limit Theorems for the Giant Component of Random Hypergraphs -- Derandomization of Euclidean Random Walks -- High Entropy Random Selection Protocols -- Testing st-Connectivity -- Properly 2-Colouring Linear Hypergraphs -- Random Subsets of the Interval and P2P Protocols -- The Cover Time of Random Digraphs -- Eigenvectors of Random Graphs: Nodal Domains -- Lower Bounds for Swapping Arthur and Merlin -- Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects -- On Estimating Frequency Moments of Data Streams -- Distribution-Free Testing Lower Bounds for Basic Boolean Functions -- On the Randomness Complexity of Property Testing -- On the Benefits of Adaptivity in Property Testing of Dense Graphs -- Slow Mixing of Markov Chains Using Fault Lines and Fat Contours -- Better Binary List-Decodable Codes Via Multilevel Concatenation -- Worst-Case to Average-Case Reductions Revisited -- On Finding Frequent Elements in a Data Stream -- Implementing Huge Sparse Random Graphs -- Sublinear Algorithms for Approximating String Compressibility. |
| Record Nr. | UNINA-9910768434703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques [[electronic resource] ] : 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30, 2006, Proceedings / / edited by Josep Diaz, Klaus Jansen, José D.P. Rolim, Uri Zwick
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques [[electronic resource] ] : 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30, 2006, Proceedings / / edited by Josep Diaz, Klaus Jansen, José D.P. Rolim, Uri Zwick |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XII, 522 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Algorithms Computer science—Mathematics Discrete mathematics Numerical analysis Software Engineering Discrete Mathematics in Computer Science Numerical Analysis |
| ISBN | 3-540-38045-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- On Nontrivial Approximation of CSPs -- Analysis of Algorithms on the Cores of Random Graphs -- Contributed Talks of APPROX -- Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs -- Approximating Precedence-Constrained Single Machine Scheduling by Coloring -- Minimizing Setup and Beam-On Times in Radiation Therapy -- On the Value of Preemption in Scheduling -- An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs -- Tight Results on Minimum Entropy Set Cover -- A Tight Lower Bound for the Steiner Point Removal Problem on Trees -- Single-Source Stochastic Routing -- An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem -- Online Algorithms to Minimize Resource Reallocations and Network Communication -- Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs -- Combinatorial Algorithms for Data Migration to Minimize Average Completion Time -- LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times -- Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees -- Improved Algorithms for Data Migration -- Approximation Algorithms for Graph Homomorphism Problems -- Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem -- Hardness of Preemptive Finite Capacity Dial-a-Ride -- Minimum Vehicle Routing with a Common Deadline -- Stochastic Combinatorial Optimization with Controllable Risk Aversion Level -- Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems -- Better Approximations for the Minimum Common Integer Partition Problem -- Contributed Talks of RANDOM -- On Pseudorandom Generators with Linear Stretch in NC0 -- A Fast Random Sampling Algorithm for Sparsifying Matrices -- The Effect of Boundary Conditions on Mixing Rates of Markov Chains -- Adaptive Sampling and Fast Low-Rank Matrix Approximation -- Robust Local Testability of Tensor Products of LDPC Codes -- Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods -- Dobrushin Conditions and Systematic Scan -- Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems -- Robust Mixing -- Approximating Average Parameters of Graphs -- Local Decoding and Testing for Homomorphisms -- Worst-Case Vs. Algorithmic Average-Case Complexity in the Polynomial-Time Hierarchy -- Randomness-Efficient Sampling Within NC 1 -- Monotone Circuits for the Majority Function -- Space Complexity vs. Query Complexity -- Consistency of Local Density Matrices Is QMA-Complete -- On Bounded Distance Decoding for General Lattices -- Threshold Functions for Asymmetric Ramsey Properties Involving Cliques -- Distance Approximation in Bounded-Degree and General Sparse Graphs -- Fractional Matching Via Balls-and-Bins -- A Randomized Solver for Linear Systems with Exponential Convergence -- Maintaining External Memory Efficient Hash Tables. |
| Record Nr. | UNISA-996466061103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||