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 [[electronic resource] ] : Selected Results and Surveys / / edited by Lasse Kliemann, Peter Sanders
Algorithm Engineering [[electronic resource] ] : Selected Results and Surveys / / edited by Lasse Kliemann, Peter Sanders
Edizione [1st ed. 2016.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
Descrizione fisica 1 online resource (X, 419 p. 68 illus.)
Disciplina 518.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Application software
Artificial intelligence
Computer networks
Computer science
Computer science—Mathematics
Discrete mathematics
Computer and Information Systems Applications
Artificial Intelligence
Computer Communication Networks
Theory of Computation
Discrete Mathematics in Computer Science
ISBN 3-319-49487-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Engineering a Lightweight and Efficient Local Search SAT Solver -- Route Planning in Transportation Networks -- Theoretical Analysis of the k-Means Algorithm - A Survey -- Recent Advances in Graph Partitioning -- How to Generate Randomized Roundings with Dependencies and How to Derandomize Them -- External-Memory State Space Search -- Algorithm Engineering Aspects of Real-Time Rendering Algorithms -- Algorithm Engineering in Robust Optimization -- Clustering Evolving Networks -- Integrating Sequencing and Scheduling: A Generic Approach with Two Exemplary Industrial Applications -- Engineering a Bipartite Matching Algorithm in the Semi-Streaming Model -- Engineering Art Galleries.
Record Nr. UNISA-996465508503316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithm Engineering [[electronic resource] ] : Selected Results and Surveys / / edited by Lasse Kliemann, Peter Sanders
Algorithm Engineering [[electronic resource] ] : Selected Results and Surveys / / edited by Lasse Kliemann, Peter Sanders
Edizione [1st ed. 2016.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
Descrizione fisica 1 online resource (X, 419 p. 68 illus.)
Disciplina 518.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Application software
Artificial intelligence
Computer networks
Computer science
Computer science—Mathematics
Discrete mathematics
Computer and Information Systems Applications
Artificial Intelligence
Computer Communication Networks
Theory of Computation
Discrete Mathematics in Computer Science
ISBN 3-319-49487-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Engineering a Lightweight and Efficient Local Search SAT Solver -- Route Planning in Transportation Networks -- Theoretical Analysis of the k-Means Algorithm - A Survey -- Recent Advances in Graph Partitioning -- How to Generate Randomized Roundings with Dependencies and How to Derandomize Them -- External-Memory State Space Search -- Algorithm Engineering Aspects of Real-Time Rendering Algorithms -- Algorithm Engineering in Robust Optimization -- Clustering Evolving Networks -- Integrating Sequencing and Scheduling: A Generic Approach with Two Exemplary Industrial Applications -- Engineering a Bipartite Matching Algorithm in the Semi-Streaming Model -- Engineering Art Galleries.
Record Nr. UNINA-9910482969203321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithm Portfolios [[electronic resource] ] : Advances, Applications, and Challenges / / by Dimitris Souravlias, Konstantinos E. Parsopoulos, Ilias S. Kotsireas, Panos M. Pardalos
Algorithm Portfolios [[electronic resource] ] : Advances, Applications, and Challenges / / by Dimitris Souravlias, Konstantinos E. Parsopoulos, Ilias S. Kotsireas, Panos M. Pardalos
Autore Souravlias Dimitris
Edizione [1st ed. 2021.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021
Descrizione fisica 1 online resource (xiv, 92 pages) : illustrations
Disciplina 518.1
Collana SpringerBriefs in Optimization
Soggetto topico Operations research
Management science
Algorithms
Microprogramming
Discrete mathematics
Operations Research, Management Science
Control Structures and Microprogramming
Discrete Mathematics
Algorismes
Optimització matemàtica
Soggetto genere / forma Llibres electrònics
ISBN 3-030-68514-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 1. Metaheuristic optimization algorithms -- 2. Algorithm portfolios -- 3. Selection of constituent algorithms -- 4. Allocation of computation resources -- 5. Sequential and parallel models -- 6. Recent applications -- 7. Epilogue -- References.
Record Nr. UNINA-9910484845003321
Souravlias Dimitris  
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithm Portfolios [[electronic resource] ] : Advances, Applications, and Challenges / / by Dimitris Souravlias, Konstantinos E. Parsopoulos, Ilias S. Kotsireas, Panos M. Pardalos
Algorithm Portfolios [[electronic resource] ] : Advances, Applications, and Challenges / / by Dimitris Souravlias, Konstantinos E. Parsopoulos, Ilias S. Kotsireas, Panos M. Pardalos
Autore Souravlias Dimitris
Edizione [1st ed. 2021.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021
Descrizione fisica 1 online resource (xiv, 92 pages) : illustrations
Disciplina 518.1
Collana SpringerBriefs in Optimization
Soggetto topico Operations research
Management science
Algorithms
Microprogramming
Discrete mathematics
Operations Research, Management Science
Control Structures and Microprogramming
Discrete Mathematics
Algorismes
Optimització matemàtica
Soggetto genere / forma Llibres electrònics
ISBN 3-030-68514-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 1. Metaheuristic optimization algorithms -- 2. Algorithm portfolios -- 3. Selection of constituent algorithms -- 4. Allocation of computation resources -- 5. Sequential and parallel models -- 6. Recent applications -- 7. Epilogue -- References.
Record Nr. UNISA-996466562303316
Souravlias Dimitris  
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021
Materiale a stampa
Lo trovi qui: Univ. di Salerno
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 [[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. 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 [[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. UNINA-9910483607203321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithm Theory -- SWAT 2012 [[electronic resource] ] : 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012, Proceedings / / edited by Fedor V. Fomin, Petteri Kaski
Algorithm Theory -- SWAT 2012 [[electronic resource] ] : 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012, Proceedings / / edited by Fedor V. Fomin, Petteri Kaski
Edizione [1st ed. 2012.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012
Descrizione fisica 1 online resource (XIII, 410 p. 62 illus.)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science—Mathematics
Discrete mathematics
Artificial intelligence—Data processing
Discrete Mathematics in Computer Science
Data Science
ISBN 3-642-31155-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISA-996465514603316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithm Theory -- SWAT 2014 [[electronic resource] ] : 14th Scandinavian Symposium and Workshops, SWAT 2014, Copenhagen, Denmark, July 2-4, 2014. Proceedings / / edited by Inge Li Gørtz, R. Ravi
Algorithm Theory -- SWAT 2014 [[electronic resource] ] : 14th Scandinavian Symposium and Workshops, SWAT 2014, Copenhagen, Denmark, July 2-4, 2014. Proceedings / / edited by Inge Li Gørtz, R. Ravi
Edizione [1st ed. 2014.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014
Descrizione fisica 1 online resource (XX, 394 p. 39 illus.)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science—Mathematics
Discrete mathematics
Artificial intelligence—Data processing
Discrete Mathematics in Computer Science
Data Science
ISBN 3-319-08404-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Online Makespan Minimization with Parallel Schedules -- Expected Linear Time Sorting for Word Size Ω(log2 n log log n) -- Amortized Analysis of Smooth Quadtrees in All Dimensions -- New Approximability Results for the Robust k-Median Problem -- Approximating the Revenue Maximization Problem with Sharp Demands -- Reconfiguring Independent Sets in Claw-Free Graphs -- Competitive Online Routing on Delaunay Triangulations -- Optimal Planar Orthogonal Skyline Counting Queries -- B-slack Trees: Space Efficient B-Trees -- Approximately Minwise Independence with Twisted Tabulation -- Colorful Bin Packing -- Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques -- Win-Win Kernelization for Degree Sequence Completion Problems -- On Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 3-Edge Dominating Set Problem -- Covering Problems in Edge- and Node-Weighted Graphs -- Colored Range Searching in Linear Space -- Fast Dynamic Graph Algorithms for Parameterized Problems -- Extending Partial Representations of Proper and Unit Interval Graphs -- Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams -- Approximate Counting of Matchings in (3,3)-Hypergraphs.
Record Nr. UNISA-996199994003316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui