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] ] : 17th International Conference, COCOA 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part II / / edited by Weili Wu, Jianxiong Guo
| Combinatorial Optimization and Applications [[electronic resource] ] : 17th International Conference, COCOA 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part II / / edited by Weili Wu, Jianxiong Guo |
| Autore | Wu Weili |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (505 pages) |
| Disciplina | 004.0151 |
| Altri autori (Persone) | GuoJianxiong |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Artificial intelligence Computer science - Mathematics Data structures (Computer science) Information theory Computer graphics Theory of Computation Artificial Intelligence Mathematics of Computing Data Structures and Information Theory Computer Graphics |
| ISBN | 3-031-49614-0 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Modeling and Algorithms -- Differentiable Discrete Optimization using Dataless Neural Networks -- When Advertising meets Assortment Planning: Joint Advertising and Assortment Optimization under Multinomial Logit Model -- Twin-treewidth: A single-exponential logic-based approach -- Highway Preferential Attachment Models for Geographic Routing -- Complexity and Approximation -- Restricted Holant Dichotomy on Domains 3 and 4 -- Earliest Deadline First is a $2$-approximation for DARP with Time Windows -- Improved approximation for broadcasting in k-Path Graphs -- The fine-grained complexity of approximately counting proper connected colorings (extended abstract) -- Combinatorics and Computing -- Strong edge coloring of subquartic graphs -- Two multicolor Ramsey numbers involving bipartite graphs -- Mechanism Design for Time-Varying Value Tasks in High-Load Edge Computing Markets -- Computing random r-orthogonal Latin squares -- Optimization and Algorithms -- A Two-stage Seeds Algorithm for Competitive Influence Maximization considering User Demand -- Practical Attribute-Based Multi-Keyword Search Scheme with Sensitive Information Hiding for Cloud Storage Systems -- Testing Higher-order Clusterability on graphs -- The $2$-mixed-center color spanning problem -- A Dynamic Parameter Adaptive Path Planning Algorithm -- On the Mating Between a Polygonal Curve and a Convex Polygon -- A Faster Parameterized Algorithm for Bipartite 1-Sided Vertex Explosion -- Multi-Winner Approval Voting with Grouped Voters -- EFX Allocation to Chores Over Small Graph -- Extreme Graph and Others -- Zero-visibility Cops and Robber game on Cage graph -- Online Facility Assignment for General Layout of Servers on a Line -- Guarding Precise and Imprecise Polyhedral Terrains with Segments -- The Bag-Based Search: A meta-algorithm to construct tractable logical circuits for graphs based on tree decomposition -- On Problems Related to Absent Subsequences -- Some Combinatorial Algorithms on the Dominating Number of Anti-Rank k Hypergraphs -- Parameterized and exact-exponential algorithms for the read-once integer refutation problem in UTVPI constraints -- Critical $(P_5,dart)$-Free Graphs -- Graph Clustering through Users' Properties and Social Influence -- Machine Learning, Blockchain and Others -- Incorporating Neural Point Process-based Temporal Feature for Rumor Detection -- Improving Contraction Hierarchies by Combining with All-Pairs Shortest Paths Problem Algorithms -- Information Theory of Blockchain Systems -- Machine Learning with Low Resource Data from Psychiatric Clinics -- Single Image Dehazing Based on Dynamic Convolution and Transformer -- Reinforcement Learning for Combating Cyberbullying in Online Social Networks. |
| Record Nr. | UNINA-9910770253503321 |
Wu Weili
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Optimization and Applications [[electronic resource] ] : 17th International Conference, COCOA 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part I / / edited by Weili Wu, Jianxiong Guo
| Combinatorial Optimization and Applications [[electronic resource] ] : 17th International Conference, COCOA 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part I / / edited by Weili Wu, Jianxiong Guo |
| Autore | Wu Weili |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (535 pages) |
| Disciplina | 004.0151 |
| Altri autori (Persone) | GuoJianxiong |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Data structures (Computer science) Information theory Computer science - Mathematics Artificial intelligence Computer graphics Theory of Computation Data Structures and Information Theory Mathematics of Computing Artificial Intelligence Computer Graphics |
| ISBN | 3-031-49611-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Optimization in Graphs -- An Efficient Local Search Algorithm for Correlation Clustering on Large Graphs -- Algorithms on a path covering problem with applications in transportation -- Faster Algorithms for Evacuation Problems in Networks with a Single Sink of Small Degree and Bounded Capacitated Edges -- An O(log n)-Competitive Posted-Price Algorithm for Online Matching on the Line -- Online Dominating Set and Coloring -- Near-Bipartiteness, Connected Near-Bipartiteness, Independent Feedback Vertex Set and Acyclic Vertex Cover on graphs having small dominating sets -- Exactly k MSTs: How many vertices suffice? -- Minimum Monotone Tree Decomposition of Density Functions Defined on Graphs -- Scheduling -- Exact and Approximation Algorithms for the Multi-depot Data Mule Scheduling with Handling Time and Time Span Constraints -- Two Exact Algorithms for the Packet Scheduling Problem -- Improved Scheduling with a Shared Resource -- An Energy-efficient Scheduling Method for Real-time Multi-workflow in Container Cloud -- Set-Related Optimization -- Weakly Nondominated Solutions of Set-Valued Optimization Problems with Variable Ordering Structures in Linear Spaces -- The MaxIS-Shapley Value in Perfect Graphs -- Asteroidal Sets and Dominating Paths -- A Novel Approximation Algorithm for Max-Covering Circle Problem -- GAMA: Genetic algorithm for k-coverage and connectivity with minimum sensor activation in wireless sensor networks -- Simple Heuristics for the Rooted Max Tree Coverage Problem -- Efficient Algorithms for k-Submodular Maximization with the p-system and d-knapsack Constraints -- Data Summarization beyond Monotonicity: Non-monotone Two-Stage Submodular Maximization -- Greedy+Max: An Efficient Approximation Algorithm for $k$-Submodular Knapsack Maximization -- Applied Optimization and Algorithm -- Improved Lower Bound for Estimating the Number of Defective Items -- Popularity on the Roommate Diversity Problem -- On Half Guarding Polygons -- Dynamic Programming for the Fixed Route Hybrid Electric Aircraft Charging Problem -- Algorithms for the Ridesharing with Profit Constraint Problem -- Multi-Candidate Carpooling Routing Problem and Its Approximation Algorithms -- Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-like Graphs -- The Line-constrained Maximum Coverage Facility Location Problem -- Graph Planer and Others -- On Connectedness of Solutions to Integer Linear Systems -- An exact algorithm for the line-constrained bottleneck $k$-Steiner tree problem -- The Longest Subsequence-Repeated Subsequence Problem -- An Approximation Algorithm for Covering Vertices by 4^+-Paths -- V-Words, Lyndon Words and Substring circ-UMFFs -- The Two-Center Problem of Uncertain Points on Trees -- Space-Time Graph Planner for Unsignalized Intersections with CAVs -- The Two Sheriffs Problem: Cryptographic Formalization and Generalization. |
| Record Nr. | UNINA-9910770270403321 |
|
Wu Weili
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||