Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Approximation and Online Algorithms [[electronic resource] ] : 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021, Revised Selected Papers / / edited by Jochen Koenemann, Britta Peis
| Approximation and Online Algorithms [[electronic resource] ] : 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021, Revised Selected Papers / / edited by Jochen Koenemann, Britta Peis |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (286 pages) |
| Disciplina | 516.11 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Mathematics - Data processing Computational Mathematics and Numerical Analysis Algorismes en línia Optimització matemàtica |
| Soggetto genere / forma |
Congressos
Llibres electrònics |
| ISBN | 3-030-92702-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | How to Navigate Through Obstacles -- Approximation Algorithms for Vertex- Connectivity Augmentation on the Cycle -- Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set -- An Improved Approximation Bound for Minimum Weight Dominating Set on Graphs of Bounded Arboricity -- Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs -- On b-Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 4-Edge Dominating Set Problem -- The Traveling k-Median Problem: Approximating Optimal Network Coverage -- EPTAS for Load Balancing Problem on Parallel Machines with a Non-renewable Resource -- Several methods of analysis for cardinality constrained bin packing -- Leah Epstein Weighted completion time minimization for capacitated parallel machines -- Server Cloud Scheduling -- FIFO and Randomized Competitive Packet Routing Games -- Improved Online Algorithm for Fractional Knapsack in the Random Order Model -- Improved Online Algorithm for Fractional Knapsack in the Random Order Model -- Improved Analysis of Online Balanced Clustering -- Precedence-Constrained Covering Problems with Multiplicity Constraints -- Contention Resolution, Matrix Scaling and Fair Allocation. |
| Record Nr. | UNINA-9910520076503321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Approximation and Online Algorithms [[electronic resource] ] : 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021, Revised Selected Papers / / edited by Jochen Koenemann, Britta Peis
| Approximation and Online Algorithms [[electronic resource] ] : 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021, Revised Selected Papers / / edited by Jochen Koenemann, Britta Peis |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (286 pages) |
| Disciplina | 516.11 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Mathematics - Data processing Computational Mathematics and Numerical Analysis Algorismes en línia Optimització matemàtica |
| Soggetto genere / forma |
Congressos
Llibres electrònics |
| ISBN | 3-030-92702-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | How to Navigate Through Obstacles -- Approximation Algorithms for Vertex- Connectivity Augmentation on the Cycle -- Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set -- An Improved Approximation Bound for Minimum Weight Dominating Set on Graphs of Bounded Arboricity -- Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs -- On b-Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 4-Edge Dominating Set Problem -- The Traveling k-Median Problem: Approximating Optimal Network Coverage -- EPTAS for Load Balancing Problem on Parallel Machines with a Non-renewable Resource -- Several methods of analysis for cardinality constrained bin packing -- Leah Epstein Weighted completion time minimization for capacitated parallel machines -- Server Cloud Scheduling -- FIFO and Randomized Competitive Packet Routing Games -- Improved Online Algorithm for Fractional Knapsack in the Random Order Model -- Improved Online Algorithm for Fractional Knapsack in the Random Order Model -- Improved Analysis of Online Balanced Clustering -- Precedence-Constrained Covering Problems with Multiplicity Constraints -- Contention Resolution, Matrix Scaling and Fair Allocation. |
| Record Nr. | UNISA-996464427803316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Integer Programming and Combinatorial Optimization [[electronic resource] ] : 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings / / edited by Friedrich Eisenbrand, Jochen Koenemann
| Integer Programming and Combinatorial Optimization [[electronic resource] ] : 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings / / edited by Friedrich Eisenbrand, Jochen Koenemann |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XI, 456 p. 34 illus.) |
| Disciplina | 519.77 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Numerical analysis
Algorithms Computer science—Mathematics Discrete mathematics Computer networks Artificial intelligence Numerical Analysis Discrete Mathematics in Computer Science Computer Communication Networks Artificial Intelligence |
| ISBN | 3-319-59250-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The Two-point Fano and Ideal Binary Clutters -- On Scheduling Coflows -- Integrality Gaps of Integer Knapsack Problems -- An Improved Integrality Gap for the Calinescu-Karloff-Rabani Relaxation for Multiway Cut -- Approximation of Corner Polyhedra with Families of Intersection Cuts -- The Structure of the Infinite Models in Integer Programming -- Mixed-integer Linear Representability, Disjunctions, and Variable Elimination -- Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time -- Cutting Planes from Wide Split Disjunctions -- The Salesman's Improved Tours for Fundamental Classes -- The Heterogeneous Capacitated k-Center Problem -- Local Guarantees in Graph Cuts and Clustering -- Verifying Integer Programming Results -- Long term Behavior of Dynamic Equilibria in uid Queuing Networks -- A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem -- Minimizing Multimodular Functions and Allocating Capacity in Bike-sharing Systems -- Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing -- Discrete Newton's Algorithm for Parametric Submodular Function Minimization -- Stochastic Online Scheduling on Unrelated Machines -- Online Matroid Intersection: Beating Half for Random Arrival -- Number Balancing is as Hard as Minkowski's Theorem and Shortest Vector -- An Improved Deterministic Rescaling for Linear Programming Algorithms -- Min-Max Theorems for Packing and Covering Odd (u; v)-trails -- Breaking 1 - 1/e Barrier for Non-preemptive Throughput Maximization -- A Quasi-Polynomial Approximation for the Restricted Assignment Problem -- Adaptive Submodular Ranking -- On the Notions of Facets, Weak Facets, and Extreme Functions of the Gomory-Johnson Infinite Group Problem -- Minimum Birkhoff-von Neumann Decomposition -- Maximum Matching in the Online Batch-Arrival Model -- Budget Feasible Mechanisms on Matroids -- Deterministic Discrepancy Minimization Via the Multiplicative Weight Update Method -- Mixed-integer Convex Representability -- High Degree Sum of Squares Proofs, Bienstock-Zuckerberg Hierarchy and Chvatal-Gomory Cuts -- Enumeration of Integer Points in Projections of Unbounded Polyhedral -- Excluded t-factors in Bipartite Graphs: A Unified Framework for Nonbipartite Matchings and Restricted 2-matchings -- Equilibrium Computation in Atomic Splittable Singleton Congestion Games. . |
| Record Nr. | UNISA-996466177203316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Integer Programming and Combinatorial Optimization [[electronic resource] ] : 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings / / edited by Friedrich Eisenbrand, Jochen Koenemann
| Integer Programming and Combinatorial Optimization [[electronic resource] ] : 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings / / edited by Friedrich Eisenbrand, Jochen Koenemann |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XI, 456 p. 34 illus.) |
| Disciplina | 519.77 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Numerical analysis
Algorithms Computer science—Mathematics Discrete mathematics Computer networks Artificial intelligence Numerical Analysis Discrete Mathematics in Computer Science Computer Communication Networks Artificial Intelligence |
| ISBN | 3-319-59250-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The Two-point Fano and Ideal Binary Clutters -- On Scheduling Coflows -- Integrality Gaps of Integer Knapsack Problems -- An Improved Integrality Gap for the Calinescu-Karloff-Rabani Relaxation for Multiway Cut -- Approximation of Corner Polyhedra with Families of Intersection Cuts -- The Structure of the Infinite Models in Integer Programming -- Mixed-integer Linear Representability, Disjunctions, and Variable Elimination -- Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time -- Cutting Planes from Wide Split Disjunctions -- The Salesman's Improved Tours for Fundamental Classes -- The Heterogeneous Capacitated k-Center Problem -- Local Guarantees in Graph Cuts and Clustering -- Verifying Integer Programming Results -- Long term Behavior of Dynamic Equilibria in uid Queuing Networks -- A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem -- Minimizing Multimodular Functions and Allocating Capacity in Bike-sharing Systems -- Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing -- Discrete Newton's Algorithm for Parametric Submodular Function Minimization -- Stochastic Online Scheduling on Unrelated Machines -- Online Matroid Intersection: Beating Half for Random Arrival -- Number Balancing is as Hard as Minkowski's Theorem and Shortest Vector -- An Improved Deterministic Rescaling for Linear Programming Algorithms -- Min-Max Theorems for Packing and Covering Odd (u; v)-trails -- Breaking 1 - 1/e Barrier for Non-preemptive Throughput Maximization -- A Quasi-Polynomial Approximation for the Restricted Assignment Problem -- Adaptive Submodular Ranking -- On the Notions of Facets, Weak Facets, and Extreme Functions of the Gomory-Johnson Infinite Group Problem -- Minimum Birkhoff-von Neumann Decomposition -- Maximum Matching in the Online Batch-Arrival Model -- Budget Feasible Mechanisms on Matroids -- Deterministic Discrepancy Minimization Via the Multiplicative Weight Update Method -- Mixed-integer Convex Representability -- High Degree Sum of Squares Proofs, Bienstock-Zuckerberg Hierarchy and Chvatal-Gomory Cuts -- Enumeration of Integer Points in Projections of Unbounded Polyhedral -- Excluded t-factors in Bipartite Graphs: A Unified Framework for Nonbipartite Matchings and Restricted 2-matchings -- Equilibrium Computation in Atomic Splittable Singleton Congestion Games. . |
| Record Nr. | UNINA-9910483368203321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||