top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.

Biblioteca

MARC Lista (tabellare)
Algorithm Engineering and Experimentation [[electronic resource] ] : Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised Papers / / edited by Adam L. Buchsbaum, Jack Snoeyink
Algorithm Engineering and Experimentation [[electronic resource] ] : Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised Papers / / edited by Adam L. Buchsbaum, Jack Snoeyink
Edizione [1st ed. 2001.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001
Descrizione fisica 1 online resource (VIII, 236 p.)
Disciplina 005.1
Collana Lecture Notes in Computer Science
Soggetto topico Computer programming
Database management
Algorithms
Data structures (Computer science)
Computer graphics
Numerical analysis
Programming Techniques
Database Management
Algorithm Analysis and Problem Complexity
Data Structures
Computer Graphics
Numeric Computing
ISBN 3-540-44808-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto ALENEX’01 -- Solving a “Hard” Problem to Approximate an “Easy” One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems -- CNOP - A Package for Constrained Network Optimization -- The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests -- Network Tomography through End-to-End Measurements -- Experimental Results on Statistical Approaches to Page Replacement Policies -- Estimating Resemblance of MIDI Documents -- Experiments on Adaptive Set Intersections for Text Retrieval Systems -- PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets -- Hierarchical Clustering of Trees: Algorithms and Experiments -- Travel Planning with Self-Made Maps -- New Algorithmic Challenges Arising in Measurement-Driven Networking Research -- A Probabilistic Spell for the Curse of Dimensionality -- Experimental Evaluation of the Height of a Random Set of Points in a d-Dimensional Cube -- An Empirical Study of a New Approach to Nearest Neighbor Searching -- Spectral Analysis for Data Mining -- Trade Off Between Compression and Search Times in Compact Suffix Array -- Implementation of a PTAS for Scheduling with Release Dates -- Biased Skip Lists for Highly Skewed Access Patterns.
Record Nr. UNISA-996465876603316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithm Engineering and Experimentation : Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised Papers / / edited by Adam L. Buchsbaum, Jack Snoeyink
Algorithm Engineering and Experimentation : Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised Papers / / edited by Adam L. Buchsbaum, Jack Snoeyink
Edizione [1st ed. 2001.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001
Descrizione fisica 1 online resource (VIII, 236 p.)
Disciplina 005.1
Collana Lecture Notes in Computer Science
Soggetto topico Computer programming
Database management
Algorithms
Data structures (Computer science)
Computer graphics
Numerical analysis
Programming Techniques
Database Management
Algorithm Analysis and Problem Complexity
Data Structures
Computer Graphics
Numeric Computing
ISBN 3-540-44808-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto ALENEX’01 -- Solving a “Hard” Problem to Approximate an “Easy” One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems -- CNOP - A Package for Constrained Network Optimization -- The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests -- Network Tomography through End-to-End Measurements -- Experimental Results on Statistical Approaches to Page Replacement Policies -- Estimating Resemblance of MIDI Documents -- Experiments on Adaptive Set Intersections for Text Retrieval Systems -- PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets -- Hierarchical Clustering of Trees: Algorithms and Experiments -- Travel Planning with Self-Made Maps -- New Algorithmic Challenges Arising in Measurement-Driven Networking Research -- A Probabilistic Spell for the Curse of Dimensionality -- Experimental Evaluation of the Height of a Random Set of Points in a d-Dimensional Cube -- An Empirical Study of a New Approach to Nearest Neighbor Searching -- Spectral Analysis for Data Mining -- Trade Off Between Compression and Search Times in Compact Suffix Array -- Implementation of a PTAS for Scheduling with Release Dates -- Biased Skip Lists for Highly Skewed Access Patterns.
Record Nr. UNINA-9910767575803321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithm Engineering and Experiments [[electronic resource] ] : 4th International Workshop, ALENEX 2002, San Francicsco, CA, USA, January 4-5, 2002, Revised Papers / / edited by David M. Mount, Clifford Stein
Algorithm Engineering and Experiments [[electronic resource] ] : 4th International Workshop, ALENEX 2002, San Francicsco, CA, USA, January 4-5, 2002, Revised Papers / / edited by David M. Mount, Clifford Stein
Edizione [1st ed. 2002.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Descrizione fisica 1 online resource (VIII, 212 p.)
Disciplina 005.1
Collana Lecture Notes in Computer Science
Soggetto topico Computer programming
Software engineering
Algorithms
Data structures (Computer science)
Computer graphics
Computer science—Mathematics
Programming Techniques
Software Engineering/Programming and Operating Systems
Algorithm Analysis and Problem Complexity
Data Structures
Computer Graphics
Discrete Mathematics in Computer Science
ISBN 3-540-45643-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto ALENEX 2002 -- On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs -- A Time-Sensitive System for Black-Box Combinatorial Optimization -- A Compressed Breadth-First Search for Satisfiability -- Using Multi-level Graphs for Timetable Information in Railway Systems -- Evaluating the Local Ratio Algorithm for Dynamic Storage Allocation -- An Experimental Study of Prefetching and Caching Algorithms for the World Wide Web -- The Treewidth of Java Programs -- Partitioning Planar Graphs with Costs and Weights -- Maintaining Dynamic Minimum Spanning Trees: An Experimental Study -- Experimental Evaluation of a New Shortest Path Algorithm -- Getting More from Out-of-Core Columnsort -- Topological Sweep in Degenerate Cases -- Acceleration of K-Means and Related Clustering Algorithms -- STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects -- An Improvement on Tree Selection Sort.
Record Nr. UNISA-996466364403316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithm Engineering and Experiments : 4th International Workshop, ALENEX 2002, San Francicsco, CA, USA, January 4-5, 2002, Revised Papers / / edited by David M. Mount, Clifford Stein
Algorithm Engineering and Experiments : 4th International Workshop, ALENEX 2002, San Francicsco, CA, USA, January 4-5, 2002, Revised Papers / / edited by David M. Mount, Clifford Stein
Edizione [1st ed. 2002.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Descrizione fisica 1 online resource (VIII, 212 p.)
Disciplina 005.1
Collana Lecture Notes in Computer Science
Soggetto topico Computer programming
Software engineering
Algorithms
Data structures (Computer science)
Computer graphics
Computer science—Mathematics
Programming Techniques
Software Engineering/Programming and Operating Systems
Algorithm Analysis and Problem Complexity
Data Structures
Computer Graphics
Discrete Mathematics in Computer Science
ISBN 3-540-45643-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto ALENEX 2002 -- On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs -- A Time-Sensitive System for Black-Box Combinatorial Optimization -- A Compressed Breadth-First Search for Satisfiability -- Using Multi-level Graphs for Timetable Information in Railway Systems -- Evaluating the Local Ratio Algorithm for Dynamic Storage Allocation -- An Experimental Study of Prefetching and Caching Algorithms for the World Wide Web -- The Treewidth of Java Programs -- Partitioning Planar Graphs with Costs and Weights -- Maintaining Dynamic Minimum Spanning Trees: An Experimental Study -- Experimental Evaluation of a New Shortest Path Algorithm -- Getting More from Out-of-Core Columnsort -- Topological Sweep in Degenerate Cases -- Acceleration of K-Means and Related Clustering Algorithms -- STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects -- An Improvement on Tree Selection Sort.
Record Nr. UNINA-9910767569203321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithm Theory - SWAT 2002 [[electronic resource] ] : 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings / / edited by Martti Penttonen, Erik Meineche Schmidt
Algorithm Theory - SWAT 2002 [[electronic resource] ] : 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings / / edited by Martti Penttonen, Erik Meineche Schmidt
Edizione [1st ed. 2002.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Descrizione fisica 1 online resource (XIV, 452 p.)
Disciplina 511.8
Collana Lecture Notes in Computer Science
Soggetto topico Computer programming
Algorithms
Data structures (Computer science)
Computer science—Mathematics
Computer graphics
Computer communication systems
Programming Techniques
Algorithm Analysis and Problem Complexity
Data Structures
Discrete Mathematics in Computer Science
Computer Graphics
Computer Communication Networks
ISBN 3-540-45471-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Speakers -- An Efficient Quasidictionary -- Combining Pattern Discovery and Probabilistic Modeling in Data Mining -- Scheduling -- Time and Space Efficient Multi-method Dispatching -- Linear Time Approximation Schemes for Vehicle Scheduling -- Minimizing Makespan for the Lazy Bureaucrat Problem -- A PTAS for the Single Machine Scheduling Problem with Controllable Processing Times -- Computational Geometry -- Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains -- Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D -- Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains -- Exact Algorithms and Approximation Schemes for Base Station Placement Problems -- A Factor-2 Approximation for Labeling Points with Maximum Sliding Labels -- Optimal Algorithm for a Special Point-Labeling Problem -- Random Arc Allocation and Applications -- On Neighbors in Geometric Permutations -- Graph Algorithms -- Powers of Geometric Intersection Graphs and Dispersion Algorithms -- Efficient Data Reduction for Dominating Set: A Linear Problem Kernel for the Planar Case -- Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous -- Approximation Hardness of the Steiner Tree Problem on Graphs -- The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus -- The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms -- A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid -- Approximation Algorithms for Edge-Dilation k-Center Problems -- Forewarned Is Fore-Armed: Dynamic Digraph Connectivity with Lookahead Speeds Up a Static Clustering Algorithm -- Improved Algorithms for the Random Cluster Graph Model -- ?-List Vertex Coloring in Linear Time -- Robotics -- Robot Localization without Depth Perception -- Online Parallel Heuristics and Robot Searching under the Competitive Framework -- Analysis of Heuristics for the Freeze-Tag Problem -- Approximation Algorithms -- Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems -- All-Norm Approximation Algorithms -- Approximability of Dense Instances of Nearest Codeword Problem -- Data Communication -- Call Control with k Rejections -- On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem -- Packet Bundling -- Algorithms for the Multi-constrained Routing Problem -- Computational Biology -- Computing the Threshold for q-Gram Filters -- On the Generality of Phylogenies from Incomplete Directed Characters -- Data Storage and Manipulation -- Sorting with a Forklift -- Tree Decompositions with Small Cost -- Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition -- Performance Tuning an Algorithm for Compressing Relational Tables -- A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset -- Paging on a RAM with Limited Resources -- An Optimal Algorithm for Finding NCA on Pure Pointer Machines -- Amortized Complexity of Bulk Updates in AVL-Trees.
Record Nr. UNISA-996465531103316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithm Theory - SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings / / edited by Martti Penttonen, Erik Meineche Schmidt
Algorithm Theory - SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings / / edited by Martti Penttonen, Erik Meineche Schmidt
Edizione [1st ed. 2002.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Descrizione fisica 1 online resource (XIV, 452 p.)
Disciplina 511.8
Collana Lecture Notes in Computer Science
Soggetto topico Computer programming
Algorithms
Data structures (Computer science)
Computer science—Mathematics
Computer graphics
Computer communication systems
Programming Techniques
Algorithm Analysis and Problem Complexity
Data Structures
Discrete Mathematics in Computer Science
Computer Graphics
Computer Communication Networks
ISBN 3-540-45471-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Speakers -- An Efficient Quasidictionary -- Combining Pattern Discovery and Probabilistic Modeling in Data Mining -- Scheduling -- Time and Space Efficient Multi-method Dispatching -- Linear Time Approximation Schemes for Vehicle Scheduling -- Minimizing Makespan for the Lazy Bureaucrat Problem -- A PTAS for the Single Machine Scheduling Problem with Controllable Processing Times -- Computational Geometry -- Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains -- Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D -- Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains -- Exact Algorithms and Approximation Schemes for Base Station Placement Problems -- A Factor-2 Approximation for Labeling Points with Maximum Sliding Labels -- Optimal Algorithm for a Special Point-Labeling Problem -- Random Arc Allocation and Applications -- On Neighbors in Geometric Permutations -- Graph Algorithms -- Powers of Geometric Intersection Graphs and Dispersion Algorithms -- Efficient Data Reduction for Dominating Set: A Linear Problem Kernel for the Planar Case -- Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous -- Approximation Hardness of the Steiner Tree Problem on Graphs -- The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus -- The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms -- A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid -- Approximation Algorithms for Edge-Dilation k-Center Problems -- Forewarned Is Fore-Armed: Dynamic Digraph Connectivity with Lookahead Speeds Up a Static Clustering Algorithm -- Improved Algorithms for the Random Cluster Graph Model -- ?-List Vertex Coloring in Linear Time -- Robotics -- Robot Localization without Depth Perception -- Online Parallel Heuristics and Robot Searching under the Competitive Framework -- Analysis of Heuristics for the Freeze-Tag Problem -- Approximation Algorithms -- Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems -- All-Norm Approximation Algorithms -- Approximability of Dense Instances of Nearest Codeword Problem -- Data Communication -- Call Control with k Rejections -- On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem -- Packet Bundling -- Algorithms for the Multi-constrained Routing Problem -- Computational Biology -- Computing the Threshold for q-Gram Filters -- On the Generality of Phylogenies from Incomplete Directed Characters -- Data Storage and Manipulation -- Sorting with a Forklift -- Tree Decompositions with Small Cost -- Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition -- Performance Tuning an Algorithm for Compressing Relational Tables -- A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset -- Paging on a RAM with Limited Resources -- An Optimal Algorithm for Finding NCA on Pure Pointer Machines -- Amortized Complexity of Bulk Updates in AVL-Trees.
Record Nr. UNINA-9910143901003321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithm Theory - SWAT 2006 [[electronic resource] ] : 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings / / edited by Lars Arge, Rusins Freivalds
Algorithm Theory - SWAT 2006 [[electronic resource] ] : 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings / / edited by Lars Arge, Rusins Freivalds
Edizione [1st ed. 2006.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006
Descrizione fisica 1 online resource (XII, 436 p.)
Disciplina 511.8
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer networks
Artificial intelligence—Data processing
Computer science—Mathematics
Discrete mathematics
Computer graphics
Computer Communication Networks
Data Science
Discrete Mathematics in Computer Science
Computer Graphics
ISBN 3-540-35755-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Papers -- Top-Down Analysis of Path Compression: Deriving the Inverse-Ackermann Bound Naturally (and Easily) -- Results and Problems on Self-adjusting Search Trees and Related Data Structures -- Classic and Quantum Network Coding -- Contributed Papers -- Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers -- Scheduling Jobs on Grid Processors -- Variable Sized Online Interval Coloring with Bandwidth -- A Simpler Linear-Time Recognition of Circular-Arc Graphs -- An Algorithm for Online Topological Ordering -- Dynamic Matching Markets and Voting Paths -- Sorting by Merging or Merging by Sorting? -- Finding the Position of the k-Mismatch and Approximate Tandem Repeats -- Unbiased Matrix Rounding -- Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines -- Paging with Request Sets -- Decentralization and Mechanism Design for Online Machine Scheduling -- Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes -- Exact Computation of Maximum Induced Forest -- Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus -- On the Approximation Hardness of Some Generalizations of TSP -- Reoptimization of Minimum and Maximum Traveling Salesman’s Tours -- The Node-Weighted Steiner Problem in Graphs of Restricted Node Weights -- On Guarding Rectilinear Domains -- Approximation Algorithms for the Minimum Convex Partition Problem -- Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles -- Simultaneous Embedding with Two Bends per Edge in Polynomial Area -- Acyclic Orientation of Drawings -- Improved Algorithms for Quantum Identification of Boolean Oracles -- Approximability of Minimum AND-Circuits -- Triangles, 4-Cycles and Parameterized (In-)Tractability -- Better Approximation Schemes for Disk Graphs -- An Approximation Algorithm for the Wireless Gathering Problem -- Minimum Membership Set Covering and the Consecutive Ones Property -- Approximating Rational Objectives Is as Easy as Approximating Linear Ones -- In-Place Algorithms for Computing (Layers of) Maxima -- Largest and Smallest Tours and Convex Hulls for Imprecise Points -- On Spanners of Geometric Graphs -- The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems -- Linear-Time Algorithms for Tree Root Problems -- Generalized Powers of Graphs and Their Algorithmic Use.
Record Nr. UNISA-996465858203316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithm Theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings / / edited by Lars Arge, Rusins Freivalds
Algorithm Theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings / / edited by Lars Arge, Rusins Freivalds
Edizione [1st ed. 2006.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006
Descrizione fisica 1 online resource (XII, 436 p.)
Disciplina 511.8
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer networks
Artificial intelligence—Data processing
Computer science—Mathematics
Discrete mathematics
Computer graphics
Computer Communication Networks
Data Science
Discrete Mathematics in Computer Science
Computer Graphics
ISBN 3-540-35755-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Papers -- Top-Down Analysis of Path Compression: Deriving the Inverse-Ackermann Bound Naturally (and Easily) -- Results and Problems on Self-adjusting Search Trees and Related Data Structures -- Classic and Quantum Network Coding -- Contributed Papers -- Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers -- Scheduling Jobs on Grid Processors -- Variable Sized Online Interval Coloring with Bandwidth -- A Simpler Linear-Time Recognition of Circular-Arc Graphs -- An Algorithm for Online Topological Ordering -- Dynamic Matching Markets and Voting Paths -- Sorting by Merging or Merging by Sorting? -- Finding the Position of the k-Mismatch and Approximate Tandem Repeats -- Unbiased Matrix Rounding -- Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines -- Paging with Request Sets -- Decentralization and Mechanism Design for Online Machine Scheduling -- Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes -- Exact Computation of Maximum Induced Forest -- Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus -- On the Approximation Hardness of Some Generalizations of TSP -- Reoptimization of Minimum and Maximum Traveling Salesman’s Tours -- The Node-Weighted Steiner Problem in Graphs of Restricted Node Weights -- On Guarding Rectilinear Domains -- Approximation Algorithms for the Minimum Convex Partition Problem -- Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles -- Simultaneous Embedding with Two Bends per Edge in Polynomial Area -- Acyclic Orientation of Drawings -- Improved Algorithms for Quantum Identification of Boolean Oracles -- Approximability of Minimum AND-Circuits -- Triangles, 4-Cycles and Parameterized (In-)Tractability -- Better Approximation Schemes for Disk Graphs -- An Approximation Algorithm for the Wireless Gathering Problem -- Minimum Membership Set Covering and the Consecutive Ones Property -- Approximating Rational Objectives Is as Easy as Approximating Linear Ones -- In-Place Algorithms for Computing (Layers of) Maxima -- Largest and Smallest Tours and Convex Hulls for Imprecise Points -- On Spanners of Geometric Graphs -- The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems -- Linear-Time Algorithms for Tree Root Problems -- Generalized Powers of Graphs and Their Algorithmic Use.
Record Nr. UNINA-9910484883103321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithm Theory - SWAT 2010 [[electronic resource] ] : 12th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings / / edited by Haim Kaplan
Algorithm Theory - SWAT 2010 [[electronic resource] ] : 12th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings / / edited by Haim Kaplan
Edizione [1st ed. 2010.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Descrizione fisica 1 online resource (448 p. 69 illus.)
Disciplina 005.11
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer programming
Algorithms
Computer science—Mathematics
Discrete mathematics
Computer graphics
Artificial intelligence—Data processing
Computer science
Programming Techniques
Discrete Mathematics in Computer Science
Computer Graphics
Data Science
Theory of Computation
ISBN 1-280-38728-9
9786613565204
3-642-13731-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Optimal Exploration of Terrains with Obstacles -- Reconstructing a Simple Polygon from Its Angles -- Semidefinite Programming and Approximation Algorithms: A Survey -- Strictly-Regular Number System and Data Structures -- An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times -- The Emergence of Sparse Spanners and Greedy Well-Separated Pair Decomposition -- A Bottom-Up Method and Fast Algorithms for max independent set -- Capacitated Domination Faster Than O(2 n ) -- Isomorphism for Graphs of Bounded Feedback Vertex Set Number -- On Feedback Vertex Set New Measure and New Structures -- Conflict-Free Coloring Made Stronger -- Polychromatic Coloring for Half-Planes -- A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem -- Minimum and Maximum against k Lies -- Feasible and Accurate Algorithms for Covering Semidefinite Programs -- The Quantitative Analysis of User Behavior Online – Data, Models and Algorithms -- Systems of Linear Equations over and Problems Parameterized above Average -- Capacitated max -Batching with Interval Graph Compatibilities -- A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs -- Representing a Functional Curve by Curves with Fewer Peaks -- Bregman Clustering for Separable Instances -- Improved Methods For Generating Quasi-gray Codes -- The MST of Symmetric Disk Graphs Is Light -- Vector Bin Packing with Multiple-Choice -- Bin Packing with Fixed Number of Bins Revisited -- Cops and Robber Game without Recharging -- Path Schematization for Route Sketches -- Approximation Algorithms for Free-Label Maximization -- Phase Transitions in Sampling Algorithms and the Underlying Random Structures -- Polynomial Kernels for Hard Problems on Disk Graphs -- Faster Parameterized Algorithms for Minor Containment -- Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing -- Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput -- Online Function Tracking with Generalized Penalties -- Better Bounds on Online Unit Clustering -- Online Selection of Intervals and t-Intervals -- Approximating the Maximum 3- and 4-Edge-Colorable Subgraph -- Improved Algorithm for Degree Bounded Survivable Network Design Problem -- Minimizing the Diameter of a Network Using Shortcut Edges.
Record Nr. UNISA-996465663703316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithm Theory - SWAT 2010 : 12th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings / / edited by Haim Kaplan
Algorithm Theory - SWAT 2010 : 12th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings / / edited by Haim Kaplan
Edizione [1st ed. 2010.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Descrizione fisica 1 online resource (448 p. 69 illus.)
Disciplina 005.11
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer programming
Algorithms
Computer science—Mathematics
Discrete mathematics
Computer graphics
Artificial intelligence—Data processing
Computer science
Programming Techniques
Discrete Mathematics in Computer Science
Computer Graphics
Data Science
Theory of Computation
ISBN 1-280-38728-9
9786613565204
3-642-13731-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Optimal Exploration of Terrains with Obstacles -- Reconstructing a Simple Polygon from Its Angles -- Semidefinite Programming and Approximation Algorithms: A Survey -- Strictly-Regular Number System and Data Structures -- An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times -- The Emergence of Sparse Spanners and Greedy Well-Separated Pair Decomposition -- A Bottom-Up Method and Fast Algorithms for max independent set -- Capacitated Domination Faster Than O(2 n ) -- Isomorphism for Graphs of Bounded Feedback Vertex Set Number -- On Feedback Vertex Set New Measure and New Structures -- Conflict-Free Coloring Made Stronger -- Polychromatic Coloring for Half-Planes -- A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem -- Minimum and Maximum against k Lies -- Feasible and Accurate Algorithms for Covering Semidefinite Programs -- The Quantitative Analysis of User Behavior Online – Data, Models and Algorithms -- Systems of Linear Equations over and Problems Parameterized above Average -- Capacitated max -Batching with Interval Graph Compatibilities -- A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs -- Representing a Functional Curve by Curves with Fewer Peaks -- Bregman Clustering for Separable Instances -- Improved Methods For Generating Quasi-gray Codes -- The MST of Symmetric Disk Graphs Is Light -- Vector Bin Packing with Multiple-Choice -- Bin Packing with Fixed Number of Bins Revisited -- Cops and Robber Game without Recharging -- Path Schematization for Route Sketches -- Approximation Algorithms for Free-Label Maximization -- Phase Transitions in Sampling Algorithms and the Underlying Random Structures -- Polynomial Kernels for Hard Problems on Disk Graphs -- Faster Parameterized Algorithms for Minor Containment -- Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing -- Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput -- Online Function Tracking with Generalized Penalties -- Better Bounds on Online Unit Clustering -- Online Selection of Intervals and t-Intervals -- Approximating the Maximum 3- and 4-Edge-Colorable Subgraph -- Improved Algorithm for Degree Bounded Survivable Network Design Problem -- Minimizing the Diameter of a Network Using Shortcut Edges.
Record Nr. UNINA-9910483607203321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui