Algorithmic Aspects in Information and Management
portes grátis
Algorithmic Aspects in Information and Management
18th International Conference, AAIM 2024, Virtual Event, September 21-23, 2024, Proceedings, Part I
Zhang, Zhao; Ghosh, Smita
Springer Verlag, Singapore
10/2024
270
Mole
9789819777976
Pré-lançamento - envio 15 a 20 dias após a sua edição
Descrição não disponível.
.- Optimization and Applications.
.- Maximum Core Spanning Tree Insertion Maintenance for Large Dynamic Graphs.
.- NFTO: DAG-Based Task Offloading and Energy Optimization Algorithm in Mobile Edge Computing.
.- Approximation Algorithm for the Maximum Interval Multi-Cover Problem.
.- Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network.
.- Efficient Approximation Algorithms for Parallel Batch Machine Scheduling of Malleable Jobs.
.- Cost-sharing mechanisms for the selfish open-end bin packing problem.
.- ToI-based Data Utility Maximization for UAV-assisted Wireless Sensor Networks.
.- Parity-Constrained Weighted k-Center.
.- Optimal Bridge, Twin Bridges and Beyond: Inserting Edges into a Road Network to Minimize the Constrained Diameters.
.- Dynamic DR-Submodular Maximization with Linear Costs over the Integer Lattice.
.- A distributed approximation algorithm for the total dominating set problem.
.- Revisit the online facility location problem with uniform facility cost.
.- or-Submodular maximization under a Matroid Constraint and a Knapsack Constraint.
.- A Distributed Method for Negative Content Spread Minimization on Social Networks.
.- Approximation Algorithms for the Minimum Weight Cycle/Path Partition Problem.
.- Iterative rounding for bag of tasks scheduling with rejection in high performance computing.
.- Optimization and Applications.
.- Integrated airline aircraft routing and crew pairing by alternating Lagrangian decomposition.
.- Monotone Submodular Meta-Learning under the Matroid Constraint.
.- Submodular Participatory Budgeting.
.- Approximation Algorithms for $k$-Submodular Maximization under the Fair Constraints and Size Constraints.
.- Systematic Review of Cybersecurity Disclosure Research.
.- Revisiting the stretch factor of Delaunay triangulations of points in convex position.
.- Transition-based Heterogeneous Network Embedding by Self-Attention Model of Sparse Matrix.
.- Maximum Core Spanning Tree Insertion Maintenance for Large Dynamic Graphs.
.- NFTO: DAG-Based Task Offloading and Energy Optimization Algorithm in Mobile Edge Computing.
.- Approximation Algorithm for the Maximum Interval Multi-Cover Problem.
.- Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network.
.- Efficient Approximation Algorithms for Parallel Batch Machine Scheduling of Malleable Jobs.
.- Cost-sharing mechanisms for the selfish open-end bin packing problem.
.- ToI-based Data Utility Maximization for UAV-assisted Wireless Sensor Networks.
.- Parity-Constrained Weighted k-Center.
.- Optimal Bridge, Twin Bridges and Beyond: Inserting Edges into a Road Network to Minimize the Constrained Diameters.
.- Dynamic DR-Submodular Maximization with Linear Costs over the Integer Lattice.
.- A distributed approximation algorithm for the total dominating set problem.
.- Revisit the online facility location problem with uniform facility cost.
.- or-Submodular maximization under a Matroid Constraint and a Knapsack Constraint.
.- A Distributed Method for Negative Content Spread Minimization on Social Networks.
.- Approximation Algorithms for the Minimum Weight Cycle/Path Partition Problem.
.- Iterative rounding for bag of tasks scheduling with rejection in high performance computing.
.- Optimization and Applications.
.- Integrated airline aircraft routing and crew pairing by alternating Lagrangian decomposition.
.- Monotone Submodular Meta-Learning under the Matroid Constraint.
.- Submodular Participatory Budgeting.
.- Approximation Algorithms for $k$-Submodular Maximization under the Fair Constraints and Size Constraints.
.- Systematic Review of Cybersecurity Disclosure Research.
.- Revisiting the stretch factor of Delaunay triangulations of points in convex position.
.- Transition-based Heterogeneous Network Embedding by Self-Attention Model of Sparse Matrix.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Algorithms and data structures;Algorithmic game theory and incentive analysis;Approximation algorithms and online algorithms;Automata, languages, logic, and computability;Blockchain;Combinatorial optimization;Communication networks and optimization;Complexity theory;Cryptography, reliability, and security;Graph algorithms and theory;Large graph algorithms and social network analysis;Combinatorics and discrete structures related to algorithms;Optimization algorithms in economic and operations research;Computational learning theory, knowledge discovery, data mining;Parallel and distributed computing and multicore algorithms;Quantum computing
.- Optimization and Applications.
.- Maximum Core Spanning Tree Insertion Maintenance for Large Dynamic Graphs.
.- NFTO: DAG-Based Task Offloading and Energy Optimization Algorithm in Mobile Edge Computing.
.- Approximation Algorithm for the Maximum Interval Multi-Cover Problem.
.- Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network.
.- Efficient Approximation Algorithms for Parallel Batch Machine Scheduling of Malleable Jobs.
.- Cost-sharing mechanisms for the selfish open-end bin packing problem.
.- ToI-based Data Utility Maximization for UAV-assisted Wireless Sensor Networks.
.- Parity-Constrained Weighted k-Center.
.- Optimal Bridge, Twin Bridges and Beyond: Inserting Edges into a Road Network to Minimize the Constrained Diameters.
.- Dynamic DR-Submodular Maximization with Linear Costs over the Integer Lattice.
.- A distributed approximation algorithm for the total dominating set problem.
.- Revisit the online facility location problem with uniform facility cost.
.- or-Submodular maximization under a Matroid Constraint and a Knapsack Constraint.
.- A Distributed Method for Negative Content Spread Minimization on Social Networks.
.- Approximation Algorithms for the Minimum Weight Cycle/Path Partition Problem.
.- Iterative rounding for bag of tasks scheduling with rejection in high performance computing.
.- Optimization and Applications.
.- Integrated airline aircraft routing and crew pairing by alternating Lagrangian decomposition.
.- Monotone Submodular Meta-Learning under the Matroid Constraint.
.- Submodular Participatory Budgeting.
.- Approximation Algorithms for $k$-Submodular Maximization under the Fair Constraints and Size Constraints.
.- Systematic Review of Cybersecurity Disclosure Research.
.- Revisiting the stretch factor of Delaunay triangulations of points in convex position.
.- Transition-based Heterogeneous Network Embedding by Self-Attention Model of Sparse Matrix.
.- Maximum Core Spanning Tree Insertion Maintenance for Large Dynamic Graphs.
.- NFTO: DAG-Based Task Offloading and Energy Optimization Algorithm in Mobile Edge Computing.
.- Approximation Algorithm for the Maximum Interval Multi-Cover Problem.
.- Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network.
.- Efficient Approximation Algorithms for Parallel Batch Machine Scheduling of Malleable Jobs.
.- Cost-sharing mechanisms for the selfish open-end bin packing problem.
.- ToI-based Data Utility Maximization for UAV-assisted Wireless Sensor Networks.
.- Parity-Constrained Weighted k-Center.
.- Optimal Bridge, Twin Bridges and Beyond: Inserting Edges into a Road Network to Minimize the Constrained Diameters.
.- Dynamic DR-Submodular Maximization with Linear Costs over the Integer Lattice.
.- A distributed approximation algorithm for the total dominating set problem.
.- Revisit the online facility location problem with uniform facility cost.
.- or-Submodular maximization under a Matroid Constraint and a Knapsack Constraint.
.- A Distributed Method for Negative Content Spread Minimization on Social Networks.
.- Approximation Algorithms for the Minimum Weight Cycle/Path Partition Problem.
.- Iterative rounding for bag of tasks scheduling with rejection in high performance computing.
.- Optimization and Applications.
.- Integrated airline aircraft routing and crew pairing by alternating Lagrangian decomposition.
.- Monotone Submodular Meta-Learning under the Matroid Constraint.
.- Submodular Participatory Budgeting.
.- Approximation Algorithms for $k$-Submodular Maximization under the Fair Constraints and Size Constraints.
.- Systematic Review of Cybersecurity Disclosure Research.
.- Revisiting the stretch factor of Delaunay triangulations of points in convex position.
.- Transition-based Heterogeneous Network Embedding by Self-Attention Model of Sparse Matrix.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Algorithms and data structures;Algorithmic game theory and incentive analysis;Approximation algorithms and online algorithms;Automata, languages, logic, and computability;Blockchain;Combinatorial optimization;Communication networks and optimization;Complexity theory;Cryptography, reliability, and security;Graph algorithms and theory;Large graph algorithms and social network analysis;Combinatorics and discrete structures related to algorithms;Optimization algorithms in economic and operations research;Computational learning theory, knowledge discovery, data mining;Parallel and distributed computing and multicore algorithms;Quantum computing
