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.
Combinatorial Optimization and Applications [[electronic resource] ] : 10th International Conference, COCOA 2016, Hong Kong, China, December 16–18, 2016, Proceedings / / edited by T-H. Hubert Chan, Minming Li, Lusheng Wang
| Combinatorial Optimization and Applications [[electronic resource] ] : 10th International Conference, COCOA 2016, Hong Kong, China, December 16–18, 2016, Proceedings / / edited by T-H. Hubert Chan, Minming Li, Lusheng Wang |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XV, 793 p. 161 illus.) |
| Disciplina | 519.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Computer networks Computer graphics Discrete Mathematics in Computer Science Numerical Analysis Computer Communication Networks Computer Graphics |
| ISBN | 3-319-48749-3 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Graph Theory -- Geometric Optimization -- Complexity and Data Structure -- Combinatorial Optimization -- Miscellaneous. |
| Record Nr. | UNISA-996465612403316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Optimization and Applications : 10th International Conference, COCOA 2016, Hong Kong, China, December 16–18, 2016, Proceedings / / edited by T-H. Hubert Chan, Minming Li, Lusheng Wang
| Combinatorial Optimization and Applications : 10th International Conference, COCOA 2016, Hong Kong, China, December 16–18, 2016, Proceedings / / edited by T-H. Hubert Chan, Minming Li, Lusheng Wang |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XV, 793 p. 161 illus.) |
| Disciplina | 519.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Computer networks Computer graphics Discrete Mathematics in Computer Science Numerical Analysis Computer Communication Networks Computer Graphics |
| ISBN | 3-319-48749-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Graph Theory -- Geometric Optimization -- Complexity and Data Structure -- Combinatorial Optimization -- Miscellaneous. |
| Record Nr. | UNINA-9910484311903321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computational Data and Social Networks : 11th International Conference, CSoNet 2022, Virtual Event, December 5-7, 2022, Proceedings / / Thang N. Dinh and Minming Li, editors
| Computational Data and Social Networks : 11th International Conference, CSoNet 2022, Virtual Event, December 5-7, 2022, Proceedings / / Thang N. Dinh and Minming Li, editors |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer Nature Switzerland AG, , [2023] |
| Descrizione fisica | 1 online resource (313 pages) |
| Disciplina | 006.35 |
| Collana | Lecture Notes in Computer Science Series |
| Soggetto topico |
Natural language processing (Computer science)
Online social networks |
| ISBN | 3-031-26303-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Machine Learning and Prediction -- Incorporating Neighborhood Information and Sentence Embedding Similarity into a Repost Prediction Model in Social Media Networks -- Driving factors of polarization on Twitter during protests against COVID19 mitigation measures in Vienna -- Categorizing Memes about the Ukraine Conflict -- Analyzing Scientometric Indicators of Journals and Chief Editors: A Case Study in Articial Intelligence (AI) Domain -- Link Prediction of Complex Networks based on Local Path and Closeness Centrality -- The influence of color on prices of abstract paintings -- ELA: A Time-Series Forecasting Model for LinerShipping Based on EMD-LSTM and Attention -- Knowledge transfer via word alignment and its application to Vietnamese POS tagging -- A group clustering recommendation approach based on energy distance -- Security and Blockchain -- An Implementation and Evaluation of Layer 2 for Ethereum with zkRollup -- Targeted Attack of the Air Transportation Network Global Component -- Measuring Cryptocurrency Mining in Public Cloud Services: A Security Perspective -- Do Content Management Systems Impact the Security of Free Content Websites? -- Fact-checking, Fake News, and Hate Speech -- BNnetXtreme: An enhanced methodology for Bangla fake news detection online -- Heuristic Gradient Optimization Approach to Controlling Susceptibility to Manipulation in Online Social Networks -- Identifying Targeted and Generalized Offensive Speech from Anti-Asian Social Media Conversations -- US News and Social Media Framing around Vaping -- Network Analysis -- Social Network Analysis of the Caste-Based Reservation System in India -- Structure, stability, persistence and entropy of stock networks during financial crises -- A Community Detection Algorithm using Random Walk -- Learning Heuristics for the Maximum Clique Enumeration Problem Using Low Dimensional Representations -- Optimization -- Competitive influence maximisation with nonlinear allocations -- Frank Wolfe Algorithm for Nonmonotone One-sided Smooth Function Maximization Problem -- Non-monotone $k$-submodular function maximization with individual size constraints -- A Heuristic Algorithm for Student-Project Allocation Problem -- Online File Caching on Multiple Caches in Latency-Sensitive Systems. |
| Record Nr. | UNISA-996511871503316 |
| Cham, Switzerland : , : Springer Nature Switzerland AG, , [2023] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computational Data and Social Networks : 11th International Conference, CSoNet 2022, Virtual Event, December 5–7, 2022, Proceedings / / edited by Thang N. Dinh, Minming Li
| Computational Data and Social Networks : 11th International Conference, CSoNet 2022, Virtual Event, December 5–7, 2022, Proceedings / / edited by Thang N. Dinh, Minming Li |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (313 pages) |
| Disciplina | 006.35 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Application software
Computer networks Data structures (Computer science) Information theory Computer science—Mathematics Artificial intelligence Computers Computer and Information Systems Applications Computer Communication Networks Data Structures and Information Theory Mathematics of Computing Artificial Intelligence Computing Milieux Xarxes socials en línia Tractament del llenguatge natural (Informàtica) |
| Soggetto genere / forma |
Congressos
Llibres electrònics |
| ISBN |
9783031263033
3031263030 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Machine Learning and Prediction -- Incorporating Neighborhood Information and Sentence Embedding Similarity into a Repost Prediction Model in Social Media Networks -- Driving factors of polarization on Twitter during protests against COVID19 mitigation measures in Vienna -- Categorizing Memes about the Ukraine Conflict -- Analyzing Scientometric Indicators of Journals and Chief Editors: A Case Study in Articial Intelligence (AI) Domain -- Link Prediction of Complex Networks based on Local Path and Closeness Centrality -- The influence of color on prices of abstract paintings -- ELA: A Time-Series Forecasting Model for LinerShipping Based on EMD-LSTM and Attention -- Knowledge transfer via word alignment and its application to Vietnamese POS tagging -- A group clustering recommendation approach based on energy distance -- Security and Blockchain -- An Implementation and Evaluation of Layer 2 for Ethereum with zkRollup -- Targeted Attack of the Air Transportation Network Global Component -- Measuring Cryptocurrency Mining in Public Cloud Services: A Security Perspective -- Do Content Management Systems Impact the Security of Free Content Websites? -- Fact-checking, Fake News, and Hate Speech -- BNnetXtreme: An enhanced methodology for Bangla fake news detection online -- Heuristic Gradient Optimization Approach to Controlling Susceptibility to Manipulation in Online Social Networks -- Identifying Targeted and Generalized Offensive Speech from Anti-Asian Social Media Conversations -- US News and Social Media Framing around Vaping -- Network Analysis -- Social Network Analysis of the Caste-Based Reservation System in India -- Structure, stability, persistence and entropy of stock networks during financial crises -- A Community Detection Algorithm using Random Walk -- Learning Heuristics for the Maximum Clique Enumeration Problem Using Low Dimensional Representations -- Optimization -- Competitive influence maximisation with nonlinear allocations -- Frank Wolfe Algorithm for Nonmonotone One-sided Smooth Function Maximization Problem -- Non-monotone $k$-submodular function maximization with individual size constraints -- A Heuristic Algorithm for Student-Project Allocation Problem -- Online File Caching on Multiple Caches in Latency-Sensitive Systems. |
| Record Nr. | UNINA-9910659489603321 |
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Frontiers in Algorithmics [[electronic resource] ] : 14th International Workshop, FAW 2020, Haikou, China, October 19-21, 2020, Proceedings / / edited by Minming Li
| Frontiers in Algorithmics [[electronic resource] ] : 14th International Workshop, FAW 2020, Haikou, China, October 19-21, 2020, Proceedings / / edited by Minming Li |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (IX, 145 p. 51 illus., 2 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Computer science Data structures (Computer science) Information theory Computer engineering Computer networks Discrete Mathematics in Computer Science Theory of Computation Data Structures and Information Theory Computer Engineering and Networks |
| ISBN | 3-030-59901-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996418321503316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Frontiers in Algorithmics : 14th International Workshop, FAW 2020, Haikou, China, October 19-21, 2020, Proceedings / / edited by Minming Li
| Frontiers in Algorithmics : 14th International Workshop, FAW 2020, Haikou, China, October 19-21, 2020, Proceedings / / edited by Minming Li |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (IX, 145 p. 51 illus., 2 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Computer science Data structures (Computer science) Information theory Computer engineering Computer networks Discrete Mathematics in Computer Science Theory of Computation Data Structures and Information Theory Computer Engineering and Networks |
| ISBN | 3-030-59901-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910427712703321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Frontiers of Algorithmic Wisdom : International Joint Conference, IJTCS-FAW 2022, Hong Kong, China, August 15-19, 2022, Revised Selected Papers / / Minming Li and Xiaoming Sun, editors
| Frontiers of Algorithmic Wisdom : International Joint Conference, IJTCS-FAW 2022, Hong Kong, China, August 15-19, 2022, Revised Selected Papers / / Minming Li and Xiaoming Sun, editors |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2022] |
| Descrizione fisica | 1 online resource (304 pages) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science Series |
| Soggetto topico |
Computer algorithms
Mathematics |
| ISBN | 3-031-20796-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Invited Talks -- Constrained Min-Max Optimization: Last-Iterate Convergence and Acceleration -- How Crypto, Stablecoins, CBDCs and Web3 Will Reshape Competition -- Voronoi Diagrams in the Presence of Obstacles -- Recent Progress in Online Matching -- Contents -- Papers and Talks Presented in IJTCS Tracks A-F and H-I, and the Forums -- Algorithmic Game Theory -- EFX Under Budget Constraint -- 1 Introduction -- 2 Preliminaries -- 3 Max-NSW Allocation and EFX Under Budget Constraint -- 4 Computing a BFEFX Allocation -- 5 Concluding Remarks -- References -- Two-Facility Location Games with Distance Requirement -- 1 Introduction -- 2 Preliminaries -- 3 Desirable Two-Facility Location Game with Maximum Distance Requirement -- 4 Obnoxious Two-Facility Location Game with Maximum Distance Requirement -- 5 Conclusions -- References -- Constrained Heterogeneous Two-Facility Location Games with Max-Variant Cost -- 1 Introduction -- 1.1 Our Contribution -- 1.2 Related Work -- 2 Model -- 3 Compulsory Setting -- 3.1 Sum Cost -- 3.2 Maximum Cost -- 4 Optional Setting -- 4.1 Sum Cost -- 4.2 Maximum Cost -- 5 Conclusion -- References -- Optimally Integrating Ad Auction into E-Commerce Platforms -- 1 Introduction -- 1.1 Our Contribution -- 1.2 Related Work -- 2 Notations and Preliminaries -- 2.1 Integrated Ad System -- 2.2 Mechanism Design -- 2.3 Core Problems -- 3 The Optimal Mechanisms for the IAS -- 3.1 The Unconstrained Problem -- 3.2 The Constrained Problem -- 4 Extensions -- 4.1 The Integrated Ad System with Number Budget on Ad Items -- 4.2 The Sparse Integrated Ad System -- 5 Conclusion -- References -- Verifiable Crowd Computing: Coping with Bounded Rationality -- 1 Introduction -- 1.1 Main Contributions -- 2 Additional Related Work -- 3 Preliminaries -- 4 Algorithmic Mechanism -- 5 Analysis.
5.1 A Pareto-Efficient Repeated Game Equilibrium -- 5.2 Deviation-Detection Method -- 5.3 Deviation Punishment and Terminal Payoffs -- 5.4 Mechanism Properties -- 6 Simulations -- 7 Conclusion -- References -- Game Theory in Block Chain -- Equilibrium Analysis of Block Withholding Attack: An Evolutionary Game Perspective -- 1 Introduction -- 2 The Evolutionary Game Model for BWH Attack -- 2.1 Basic Evolutionary Game Model -- 2.2 The Stable Solutions of the Evolutionary Game -- 2.3 Evolutionary Equilibrium Analysis on the Decision of BWH Attack -- 3 Conclusions -- References -- Frontiers of Algorithmic Wisdom -- An Approximation Algorithm for the H-Prize-Collecting Power Cover Problem -- 1 Introduction -- 2 Preliminaries -- 3 The Prize-Collecting Power Cover Problem -- 4 The H-Prize-Collecting Power Cover Problem -- 5 Conclusion -- References -- Online Early Work Maximization on Three Hierarchical Machines with a Common Due Date -- 1 Introduction -- 2 Preliminaries -- 3 One Machine of Hierarchy 1 -- 4 Two Machines of Hierarchy 1 -- 5 Discussion -- References -- Secure Computations Through Checking Suits of Playing Cards -- 1 Introduction -- 1.1 The Five-Card Trick -- 1.2 Protocols with a Standard Deck of Cards -- 1.3 Contribution -- 2 The Existing Card-Minimal AND Protocol -- 3 New Action: Half-Open of Playing Cards -- 4 Our Simple AND Protocol Based on Half-Open Action -- 5 Formalizing Half-Open Action -- 5.1 Notations -- 5.2 Protocols -- 6 Formal Description of Our Protocol -- 6.1 Pseudocode -- 6.2 Correctness and Security -- 7 Discussion -- 7.1 Comparison -- 7.2 Theoretical Aspects -- 7.3 Millionaire Protocol Using Half-Open -- 8 Conclusion -- References -- Streaming Submodular Maximization with the Chance Constraint -- 1 Introduction -- 2 Related Work -- 3 Preliminaries. 4 Streaming Algorithm: Uniform Independently Identically Distribution Weights (UIIDW) -- 5 Streaming Algorithm: Uniform Weights with the Same Dispersion -- 6 Conclusion -- References -- Colorful Graph Coloring -- 1 Introduction -- 2 Vertex-Coloring Vertex-Colorful -- 3 Edge-Coloring Vertex-Colorful -- 4 Edge-Coloring Edge-Colorful -- 5 Integer Linear Programming -- 6 Conclusion -- A Proof of Sect.2 -- B Proof of Sect.3 -- C Proof of Sect.4 -- References -- On the Transversal Number of Rank k Hypergraphs -- 1 Introduction -- 1.1 Known Results -- 1.2 Our Results -- 2 The Conjecture -- 3 The Rank 2 Hypergraphs -- 4 The Rank 3 Hypergraphs -- 5 The Hypergraphs with König Property -- 6 The Hypergraphs with Maximum Degree 2 -- 6.1 The Bound of Hypergraphs with Maximum Degree 2 -- 6.2 The Extremal Hypergraphs with Maximum Degree 2 -- References -- Exact Algorithms and Hardness Results for Geometric Red-Blue Hitting Set Problem -- 1 Introduction -- 1.1 Previous Work -- 1.2 Our Contributions -- 2 Preliminaries -- 3 The RBHS problem with lines and segments -- 3.1 Intervals on a Real Line IR -- 3.2 Axis-Parallel Line Segments -- 4 The RBHS Problem with Axis-Parallel Rectangles -- 4.1 Rectangles Anchored on a Horizontal Line -- 4.2 Rectangles Stabbing a Horizontal Line -- 5 APX-Hardness Results for the RBHS Problem -- References -- Bounds for the Oriented Diameter of Planar Triangulations -- 1 Introduction -- 2 Oriented Diameter of a Triangular Grid -- 3 Upper Bound on the Oriented Diameter of a Planar Triangulation -- 3.1 Planar Graphs and Schnyder Realizer -- 3.2 An Initial Upper Bound -- 3.3 An Improved Upper Bound -- 4 Lower Bound -- 5 Planar Weighted Oriented Diameter -- 5.1 Planar Weighted Oriented Diameter Is Weakly NP-complete -- 6 Conclusion -- References -- String Rearrangement Inequalities and a Total Order Between Primitive Words -- 1 Introduction. 1.1 Related Work -- 2 Preliminaries -- 3 A Linear Time Algorithm for Sorting the Repeating Words -- 4 The String Rearrangement Inequalities -- 5 A Total Order on Words -- 6 Conclusions -- A An alternative proof of Lemma 3 -- References -- Approximation Algorithms for Prize-Collecting Capacitated Network Design Problems -- 1 Introduction -- 1.1 Related Works -- 1.2 Our Results -- 2 Preliminaries -- 2.1 Prize-Collecting Capacitated Network Design Problem -- 2.2 Prize-Collecting Facility Location Problem -- 2.3 Prize-Collecting Steiner Tree Problem -- 3 Algorithm and Analysis -- 3.1 Bound the Cost of Opening Sinks and Paying Prizes -- 3.2 Bound the Cost of Installing Cables -- 3.3 Case of Single Sink -- 4 Conclusion -- References -- Computational and Network Economics -- Possible and Necessary Winner Problems in Iterative Elections with Multiple Rules -- 1 Introduction -- 2 Preliminaries -- 2.1 Iterative Voting Rules -- 2.2 Possible and Necessary Winner Problems -- 3 Possible Winner -- 4 Necessary Winner -- 5 Conclusion -- References -- A Mechanism Design Approach for Multi-party Machine Learning -- 1 Introduction -- 1.1 Related Works -- 2 Preliminaries -- 2.1 Valid Data Size (Type) -- 2.2 Learning Protocol -- 2.3 Mechanism -- 2.4 Comparison with the Standard Interdependent Value Setting -- 3 Quasi-Monotone Externality Setting -- 4 General Externality Setting -- 5 Market Growth Rate -- 6 Finding a Desirable Mechanism -- 7 Conclusion -- A Proof of Theorem1 -- B Proof of Corollary1 -- C Proof of Theorem2 -- D Proof of Theorem3 -- E Proof of Theorem4 -- F Proof of Theorem5 -- G Experiments -- G.1 The MEP Mechanism -- G.2 Existence of Desirable Mechanisms -- References -- Budget-Feasible Sybil-Proof Mechanisms for Crowdsensing -- 1 Introduction -- 2 Related Work -- 3 Preliminaries -- 3.1 Reverse Auction Model -- 3.2 Sybil Attack -- 3.3 Properties. 4 Sybil Attack on Budget-Feasible Mechanisms -- 5 Mechanism TBS -- 5.1 Theoretical Analysis on Desired Properties -- 6 Performance Evaluation -- 6.1 Evaluation of Desired Properties -- 6.2 Evaluation of Optimization Metrics -- 7 Conclusion -- References -- Author Index. |
| Record Nr. | UNISA-996503467703316 |
| Cham, Switzerland : , : Springer, , [2022] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Frontiers of Algorithmic Wisdom : International Joint Conference, IJTCS-FAW 2022, Hong Kong, China, August 15–19, 2022, Revised Selected Papers / / edited by Minming Li, Xiaoming Sun
| Frontiers of Algorithmic Wisdom : International Joint Conference, IJTCS-FAW 2022, Hong Kong, China, August 15–19, 2022, Revised Selected Papers / / edited by Minming Li, Xiaoming Sun |
| Edizione | [1st ed. 2022.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 |
| Descrizione fisica | 1 online resource (304 pages) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science - Mathematics
Discrete mathematics Numerical analysis Data structures (Computer science) Information theory Computer engineering Computer networks Software engineering Algorithms Discrete Mathematics in Computer Science Numerical Analysis Data Structures and Information Theory Computer Engineering and Networks Software Engineering Design and Analysis of Algorithms |
| ISBN |
9783031207969
3031207963 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithmic Game Theory -- EFX under Budget Constraint -- Two-Facility Location Game with Distance Requirement -- Constrained Heterogeneous Two-facility Location Games with Max-variant Cost -- Optimally Integrating Ad Auction into E-Commerce Platforms -- Verifiable Crowd Computing: Coping with Bounded Rationality -- Game Theory in Block Chain -- Equilibrium analysis of block withholding attack: an evolutionary game perspective -- Frontiers of Algorithmic Wisdom -- An approximation algorithm for the H-prize-collecting power cover problem -- Online early work maximization on three hierarchical machines with a common due date -- Secure Computations through Checking Suits of Playing Cards -- Streaming Submodular Maximization with the Chance Constraint -- Colorful Graph Coloring -- On the Transversal Number of Rank k Hypergraphs -- Exact Algorithms and Hardness Results for Geometric Red-Blue Hitting Set Problem -- Bounds for the Oriented Diameter of Planar Triangulations -- String Rearrangement Inequalities and a Total Order Between Primitive Words -- Approximation Algorithms for Prize-Collecting Capacitated Network Design Problems -- Computational and Network Economics -- Possible and Necessary Winner Problems in Iterative Elections with Multiple Rules -- A Mechanism Design Approach for Multi-Party Machine Learning -- Budget-Feasible Sybil-Proof Mechanisms for Crowdsensing. |
| Record Nr. | UNINA-9910637718903321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Frontiers of Algorithmics : 19th International Joint Conference, IJTCS-FAW 2025, Paris, France, June 30 – July 2, 2025, Proceedings / / edited by Vincent Chau, Christoph Dürr, Minming Li, Pinyan Lu
| Frontiers of Algorithmics : 19th International Joint Conference, IJTCS-FAW 2025, Paris, France, June 30 – July 2, 2025, Proceedings / / edited by Vincent Chau, Christoph Dürr, Minming Li, Pinyan Lu |
| Autore | Chau Vincent |
| Edizione | [1st ed. 2025.] |
| Pubbl/distr/stampa | Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2025 |
| Descrizione fisica | 1 online resource (747 pages) |
| Disciplina | 004.0151 |
| Altri autori (Persone) |
DürrChristoph <1969->
LiMinming LuPinyan |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science - Mathematics
Discrete mathematics Numerical analysis Data structures (Computer science) Information theory Computer networks Software engineering Algorithms Discrete Mathematics in Computer Science Numerical Analysis Data Structures and Information Theory Computer Communication Networks Software Engineering Design and Analysis of Algorithms |
| ISBN | 9789819683123 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Domination in Diameter Two Graphs and the 2 Club Cluster Vertex Deletion Parameter -- $k$-Universality of Regular Languages Revisited -- Comparing the Hardness of Online Minimization and Maximization Problems with Predictions -- Complexity Classes for Online Problems with and without Predictions -- Scheduling with Testing: Competitive Algorithms for Minimizing the Total Weighted Completion Time in the Adversarial Model -- Mixed Graph Covering with Target Constraints -- Multiplication of 0-1 matrices via clustering -- From MAXCUT to MAXNAESAT: Elegant Proofs and Algorithmic Advances -- Exact Algorithms for the Maximum $k$-Balanced Weighted Biclique Problem -- Approximation Algorithms for Individual Preference Facility Location -- The online power cover problem on a line -- The Subinterval Cover Problem -- Oblivious Robots Under Round Robin: Gathering on Rings -- Finding a Set of Long Common Substrings with Repeats from m Input Strings -- A LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties -- Less-excludable Mechanism for DAOs in Public Good Auctions -- TBDS: Transaction-Based Data Sharing -- Pure Nash Equilibria of Weighted Picking Sequence Protocol is WEF1 for Two Agents -- A Comparative Study of Waitlist Mechanisms: Deferral Versus Pay-Per-Offer -- Optimal Repurchasing Contract Design for Efficient Utilization of Computing Resources -- Characterizing Strategyproofness Through Score Functions in Voting Mechanisms -- Minimizing Blocking Agents for Stable Matching with Partial Approval Information -- The Capacity-Constrained Facility Location Problem with Ordinal Preferences: Algorithmic and Mechanism Design Perspectives -- Regularized Minimax-V Learning for Solving Randomly Terminating Two-player Zero-sum Markov Games -- Improved Approximation of Maximin Share Fair Allocation under Generalized Assignment Constraints -- Optimal Hiring Strategy in Auction-Based Crowdsourcing Systems -- Large-Scale Contextual Market Equilibrium Computation through Deep Learning -- Fair Value Distribution in Cooperative Committee Election -- A Payoff-Based Policy Gradient Method in Stochastic Games with Long-Run Average Payoffs -- Mechanism Design for Auctions with Externalities on Budgets. |
| Record Nr. | UNINA-9911011817803321 |
Chau Vincent
|
||
| Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2025 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Frontiers of Algorithmics : 19th International Joint Conference, IJTCS-FAW 2025, Paris, France, June 30 – July 2, 2025, Proceedings / / edited by Vincent Chau, Christoph Dürr, Minming Li, Pinyan Lu
| Frontiers of Algorithmics : 19th International Joint Conference, IJTCS-FAW 2025, Paris, France, June 30 – July 2, 2025, Proceedings / / edited by Vincent Chau, Christoph Dürr, Minming Li, Pinyan Lu |
| Autore | Chau Vincent |
| Edizione | [1st ed. 2025.] |
| Pubbl/distr/stampa | Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2025 |
| Descrizione fisica | 1 online resource (747 pages) |
| Disciplina | 004.0151 |
| Altri autori (Persone) |
DürrChristoph <1969->
LiMinming LuPinyan |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science - Mathematics
Discrete mathematics Numerical analysis Data structures (Computer science) Information theory Computer networks Software engineering Algorithms Discrete Mathematics in Computer Science Numerical Analysis Data Structures and Information Theory Computer Communication Networks Software Engineering Design and Analysis of Algorithms |
| ISBN | 9789819683123 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Domination in Diameter Two Graphs and the 2 Club Cluster Vertex Deletion Parameter -- $k$-Universality of Regular Languages Revisited -- Comparing the Hardness of Online Minimization and Maximization Problems with Predictions -- Complexity Classes for Online Problems with and without Predictions -- Scheduling with Testing: Competitive Algorithms for Minimizing the Total Weighted Completion Time in the Adversarial Model -- Mixed Graph Covering with Target Constraints -- Multiplication of 0-1 matrices via clustering -- From MAXCUT to MAXNAESAT: Elegant Proofs and Algorithmic Advances -- Exact Algorithms for the Maximum $k$-Balanced Weighted Biclique Problem -- Approximation Algorithms for Individual Preference Facility Location -- The online power cover problem on a line -- The Subinterval Cover Problem -- Oblivious Robots Under Round Robin: Gathering on Rings -- Finding a Set of Long Common Substrings with Repeats from m Input Strings -- A LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties -- Less-excludable Mechanism for DAOs in Public Good Auctions -- TBDS: Transaction-Based Data Sharing -- Pure Nash Equilibria of Weighted Picking Sequence Protocol is WEF1 for Two Agents -- A Comparative Study of Waitlist Mechanisms: Deferral Versus Pay-Per-Offer -- Optimal Repurchasing Contract Design for Efficient Utilization of Computing Resources -- Characterizing Strategyproofness Through Score Functions in Voting Mechanisms -- Minimizing Blocking Agents for Stable Matching with Partial Approval Information -- The Capacity-Constrained Facility Location Problem with Ordinal Preferences: Algorithmic and Mechanism Design Perspectives -- Regularized Minimax-V Learning for Solving Randomly Terminating Two-player Zero-sum Markov Games -- Improved Approximation of Maximin Share Fair Allocation under Generalized Assignment Constraints -- Optimal Hiring Strategy in Auction-Based Crowdsourcing Systems -- Large-Scale Contextual Market Equilibrium Computation through Deep Learning -- Fair Value Distribution in Cooperative Committee Election -- A Payoff-Based Policy Gradient Method in Stochastic Games with Long-Run Average Payoffs -- Mechanism Design for Auctions with Externalities on Budgets. |
| Record Nr. | UNISA-996664549203316 |
|
Chau Vincent
|
||
| Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2025 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||