Edizione	[1st ed. 2018.]
Pubbl/distr/stampa	Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Descrizione fisica	1 online resource (X, 349 p. 39 illus., 22 illus. in color.)
Disciplina	005.1
Collana	Theoretical Computer Science and General Issues
Soggetto topico	Algorithms Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Numerical analysis Computer engineering Computer networks Discrete Mathematics in Computer Science Data Science Numerical Analysis Computer Engineering and Networks
ISBN	3-030-04693-1
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Some Easy and Some Not So Easy Geometric Optimization Problems -- Deterministic Min-Cost Matching with Delays -- Sequential Metric Dimension -- A Primal-Dual Online Deterministic Algorithm for Matching with Delays -- Advice Complexity of Priority Algorithms -- Approximating Node-Weighted k-MST on Planar Graphs -- Exploring Sparse Graphs with Advice -- Call Admission Problems on Grids with Advice -- Improved Approximation Algorithms for Minimum Power Covering Problems -- DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals -- Strategic Contention Resolution in Multiple Channels -- Sublinear Graph Augmentation for Fast Query Implementation -- Bin Packing Games with Weight Decision: How To Get a Small Value for the Price of Anarchy -- Probabilistic Embeddings of the Fréchet Distance -- Algorithms for Dynamic NFV Workload -- Longest Increasing Subsequence under Persistent Comparison Errors -- Cut Sparsifiers for Balanced Digraphs -- Reconfiguration of Graphs with Connectivity Constraints -- The Itinerant List Update Problem -- The Price of Fixed Assignments in Stochastic Extensible Bin Packing.
Record Nr.	UNISA-996466188003316

Edizione	[1st ed. 2017.]
Pubbl/distr/stampa	Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017
Descrizione fisica	1 online resource (XIV, 211 p. 23 illus.)
Disciplina	005.1
Collana	Theoretical Computer Science and General Issues
Soggetto topico	Algorithms Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Numerical analysis Discrete Mathematics in Computer Science Data Science Numerical Analysis
ISBN	3-319-51741-4
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Approximation Algorithms for the k-Set Packing Problem -- On Linear and Semidefinite Programs for Polytopes in Combinatorial Optimization -- The Shortest Separating Cycle Problem -- Dynamic Traveling Repair Problem with an Arbitrary Time Window -- A PTAS for the Cluster Editing Problem on Planar Graphs -- Bin Packing with Colocations -- Batch Coloring of Graphs -- New Integrality Gap Results for the Firefighters Problem on Trees -- A Multiplicative Weights Update Algorithm for Packing and Covering Semi-Infinite Linear Programs -- Balanced Optimization with Vector Costs -- Vertex Sparsification in Trees -- Scenario Submodular Cover -- Non-Greedy Online Steiner Trees on Outerplanar Graphs -- A Refined Analysis of Online Path Coloring in Trees -- Resource Allocation Games with Multiple Resource Classes -- Tight Approximation Bounds for the Seminar Assignment Problem -- A Priori TSP in the Scenario Model -- Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems. .
Record Nr.	UNISA-996466083503316

Edizione	[1st ed. 2015.]
Pubbl/distr/stampa	Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015
Descrizione fisica	1 online resource (X, 209 p. 24 illus. in color.)
Disciplina	004
Collana	Theoretical Computer Science and General Issues
Soggetto topico	Algorithms Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Computer science Numerical analysis Discrete Mathematics in Computer Science Data Science Theory of Computation Numerical Analysis
ISBN	3-319-28684-6
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Algorithmic game theory -- Algorithmic trading -- Coloring and partitioning -- Competitive analysis -- Computational advertising -- Computational finance -- Cuts and connectivity -- Geometric problems -- Graph algorithms -- Inapproximability -- Mechanism design -- Natural algorithms -- Network design -- Packing and covering.-Paradigms for the design and analysis of approximation and online algorithms.-Parameterized complexity. Scheduling problems. -Real-world applications.
Record Nr.	UNISA-996466360003316

Edizione	[1st ed. 2009.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Descrizione fisica	1 online resource (X, 293 p.)
Disciplina	005.1
Collana	Theoretical Computer Science and General Issues
Soggetto topico	Algorithms Computer science—Mathematics Discrete mathematics Numerical analysis Computer graphics Artificial intelligence—Data processing Discrete Mathematics in Computer Science Numerical Analysis Computer Graphics Data Science
ISBN	3-540-93980-6
Classificazione	DAT 530f MAT 410f MAT 652f SS 4800
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	WAOA 2008 -- Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees -- Size Versus Stability in the Marriage Problem -- Degree-Constrained Subgraph Problems: Hardness and Approximation Results -- A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines -- Improved Randomized Online Scheduling of Unit Length Intervals and Jobs -- Minimizing Average Flow Time on Unrelated Machines -- Cooperation in Multiorganization Matching -- Randomized Algorithms for Buffer Management with 2-Bounded Delay -- A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints -- Malicious Bayesian Congestion Games -- Stackelberg Strategies and Collusion in Network Games with Splittable Flow -- Peak Shaving through Resource Buffering -- On Lagrangian Relaxation and Subset Selection Problems -- Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements -- Caching Content under Digital Rights Management -- Reoptimization of Weighted Graph and Covering Problems -- Smoothing Imprecise 1.5D Terrains -- Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs -- Dynamic Offline Conflict-Free Coloring for Unit Disks -- Experimental Analysis of Scheduling Algorithms for Aggregated Links -- A Approximation Algorithm for the Minimum Maximal Matching Problem -- On the Maximum Edge Coloring Problem.
Record Nr.	UNISA-996466130503316

Edizione	[1st ed. 2008.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008
Descrizione fisica	1 online resource (X, 294 p.)
Disciplina	519
Collana	Theoretical Computer Science and General Issues
Soggetto topico	Software engineering Algorithms Computer science—Mathematics Discrete mathematics Numerical analysis Computer graphics Artificial intelligence—Data processing Software Engineering Discrete Mathematics in Computer Science Numerical Analysis Computer Graphics Data Science
ISBN	3-540-77918-3
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations -- Improved Lower Bounds for Non-utilitarian Truthfulness -- Buyer-Supplier Games: Optimization over the Core -- Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines -- A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays -- Online Algorithm for Parallel Job Scheduling and Strip Packing -- Geometric Spanners with Small Chromatic Number -- Approximating Largest Convex Hulls for Imprecise Points -- A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem -- Covering the Edges of Bipartite Graphs Using K 2,2 Graphs -- On Min-Max r-Gatherings -- On the Max Coloring Problem -- Full and Local Information in Distributed Decision Making -- The Minimum Substring Cover Problem -- A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs -- On the Online Unit Clustering Problem -- Better Bounds for Incremental Medians -- Minimum Weighted Sum Bin Packing -- Approximation Schemes for Packing Splittable Items with Cardinality Constraints -- A Randomized Algorithm for Two Servers in Cross Polytope Spaces -- Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems -- Online Rectangle Filling.
Record Nr.	UNISA-996466370803316