標(biāo)題: Titlebook: Combinatorial Optimization and Applications; 16th International C Weili Wu,Jianxiong Guo Conference proceedings 2024 The Editor(s) (if appl [打印本頁(yè)] 作者: industrious 時(shí)間: 2025-3-21 17:23
書目名稱Combinatorial Optimization and Applications影響因子(影響力)
書目名稱Combinatorial Optimization and Applications影響因子(影響力)學(xué)科排名
書目名稱Combinatorial Optimization and Applications網(wǎng)絡(luò)公開度
書目名稱Combinatorial Optimization and Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Combinatorial Optimization and Applications被引頻次
書目名稱Combinatorial Optimization and Applications被引頻次學(xué)科排名
書目名稱Combinatorial Optimization and Applications年度引用
書目名稱Combinatorial Optimization and Applications年度引用學(xué)科排名
書目名稱Combinatorial Optimization and Applications讀者反饋
書目名稱Combinatorial Optimization and Applications讀者反饋學(xué)科排名
作者: 凌辱 時(shí)間: 2025-3-21 21:00 作者: investigate 時(shí)間: 2025-3-22 04:25
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/229973.jpg作者: SSRIS 時(shí)間: 2025-3-22 05:44 作者: TRUST 時(shí)間: 2025-3-22 11:15
978-3-031-49613-4The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl作者: Wordlist 時(shí)間: 2025-3-22 13:53
Julien Lancia,Guillaume Bouffard denotes a class of counting problems specified by a constraint function .. We prove complexity dichotomy theorems for . in two settings: (1) . is any symmetric arity-3 real-valued function on input of domain size 3. (2) . is any symmetric arity-3 .-valued function on input of domain size 4.作者: Wordlist 時(shí)間: 2025-3-22 18:36 作者: refine 時(shí)間: 2025-3-22 21:28
Restricted Holant Dichotomy on?Domains 3 and?4 denotes a class of counting problems specified by a constraint function .. We prove complexity dichotomy theorems for . in two settings: (1) . is any symmetric arity-3 real-valued function on input of domain size 3. (2) . is any symmetric arity-3 .-valued function on input of domain size 4.作者: 可互換 時(shí)間: 2025-3-23 05:08 作者: Amendment 時(shí)間: 2025-3-23 05:40
Fabrizio De Santis,Tobias Bauer,Georg Siglnts. Famous problems in this space include maximum satisfiability and maximum independent set. Due to their discrete dynamics, these problems are not differentiable in their natural formulations. In this paper, we explore the counter-intuitive direction of differentiable discrete optimization by lev作者: GROUP 時(shí)間: 2025-3-23 13:05
Fabrizio De Santis,Tobias Bauer,Georg Sigl issue has not been well-explored. This paper aims to fill the gap in research by addressing the joint advertising and assortment optimization problem. We propose that advertising can influence product selection by increasing preference for certain products, and the extent of this effect is determin作者: 容易生皺紋 時(shí)間: 2025-3-23 16:50
Mario Werner,Erich Wenger,Stefan Mangardrameters, such as neighborhood diversity, twin-cover, twin-width, and modular width. In this work, we introduce a new parameter in graphs called twin-treewidth, which explores the equivalence classes of twins. This parameter generalizes treewidth and neighborhood diversity, two of the most studied p作者: 拱形面包 時(shí)間: 2025-3-23 19:14
Sergej Proskurin,Michael Wei?,Georg Sigl acquaintances between any two arbitrary people, but that these arbitrary strangers are able to find these short chains. This phenomenon, known as the ., is explained in part by any model that has a low diameter, such as the Barabási and Albert’s . model, but these models do not display the same eff作者: 輕而薄 時(shí)間: 2025-3-23 23:31
https://doi.org/10.1007/978-3-319-31271-2 offline DARP in a uniform metric space where requests have release times and deadlines, and are all of equal duration and value. The goal is for a single unit-speed, unit-capacity server to serve as many requests as possible by an overall time limit, and this problem is NP-hard. We show that a natu作者: 詢問 時(shí)間: 2025-3-24 03:20 作者: 不成比例 時(shí)間: 2025-3-24 07:30 作者: misanthrope 時(shí)間: 2025-3-24 11:42 作者: Oligarchy 時(shí)間: 2025-3-24 18:02
Smart Cards for Mobile Communications,rvers is limited. It is necessary to design appropriate resource allocation and pricing mechanisms to address this resource competition dilemma. This paper proposes an auction-based mechanism called GMPO from an economic perspective. A market where multiple buyers and sellers compete with each other作者: 令人心醉 時(shí)間: 2025-3-24 20:14 作者: 割讓 時(shí)間: 2025-3-25 02:16
Konstantinos Markantonakis,David Mainetitive influence maximization problem explores the competition between multiple entities on the same network, aiming to select a certain number of seeds for one of the entities to maximize the spread of its influence. However, the latest competitive influence maximization researches ignore the impa作者: Highbrow 時(shí)間: 2025-3-25 03:43
https://doi.org/10.1007/978-3-662-61136-4 issues impede wide application of ABMKS. Firstly, the majority of ABMKS schemes have suffered huge computation and communication costs in the process of ciphertexts matching and transmission. Secondly, the contents of data file containing sensitive information are encrypted as a whole, and data use作者: 枯萎將要 時(shí)間: 2025-3-25 07:55
https://doi.org/10.1007/978-3-662-61136-4 a new problem of testing higher-order clusterability: given query access to an undirected graph, can we judge whether this graph can be partitioned into a few clusters of highly-connected motifs? This problem is an extension of the former work proposed by Czumaj et al. (STOC’ 15), who recognized cl作者: Popcorn 時(shí)間: 2025-3-25 14:50
Combinatorial Optimization and Applications978-3-031-49614-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: HEED 時(shí)間: 2025-3-25 16:09 作者: Fantasy 時(shí)間: 2025-3-25 23:10
https://doi.org/10.1007/978-0-387-72198-9atin squares of order . is known. A Latin square . of order . is .-self-orthogonal if . and its transpose are .-orthogonal. The spectrum of all values of . is known for all orders .. We develop randomized algorithms for computing pairs of .-orthogonal Latin squares of order . and algorithms for computing .-self-orthogonal Latin squares of order ..作者: RLS898 時(shí)間: 2025-3-26 02:14
Mario Werner,Erich Wenger,Stefan Mangardarameters in parameterized complexity. We demonstrate the usefulness of this parameter by proposing a simple exponential-time generic procedure to solve problems that can be expressed in a fragment of a variant of Second-Order Monadic Logic.作者: 騷動(dòng) 時(shí)間: 2025-3-26 07:11 作者: 合同 時(shí)間: 2025-3-26 08:40 作者: Subjugate 時(shí)間: 2025-3-26 16:20 作者: 大吃大喝 時(shí)間: 2025-3-26 19:54 作者: 600 時(shí)間: 2025-3-27 00:09
https://doi.org/10.1007/978-3-319-31271-2classes of networks. There also exist various heuristic and approximation algorithms for different network topologies. In this paper, we will consider networks that can be represented as .-path graphs. We will present a polynomial time 2-approximation algorithm for the broadcast time problem in .-path graphs.作者: 迷住 時(shí)間: 2025-3-27 04:49 作者: 先鋒派 時(shí)間: 2025-3-27 06:51
Smart Cards for Mobile Communications,d priorities and charge based on critical prices. The experiment results demonstrate that the proposed mechanism can effectively improve social welfare and guarantee the economic properties of auctions.作者: instructive 時(shí)間: 2025-3-27 12:23
Differentiable Discrete Optimization Using Dataless Neural Networksrete problems and prove the correctness of our derivations. The proposed differentiable forms open up the avenue for continuous differentiable optimization to be brought to bear on classical discrete optimization problems.作者: ANIM 時(shí)間: 2025-3-27 15:24 作者: Gesture 時(shí)間: 2025-3-27 20:55 作者: 諄諄教誨 時(shí)間: 2025-3-28 01:40
Mechanism Design for?Time-Varying Value Tasks in?High-Load Edge Computing Marketsd priorities and charge based on critical prices. The experiment results demonstrate that the proposed mechanism can effectively improve social welfare and guarantee the economic properties of auctions.作者: 爭(zhēng)吵 時(shí)間: 2025-3-28 05:10
Conference proceedings 2024nd Applications,?COCOA 2023,?held in?Hawaii, HI, USA, during?December 15–17, 2023.?.The 73 full papers included?in the proceedings?were carefully reviewed and selected from 117 submissions.?They were organized in topical sections as follows:?.Part I: Optimization in graphs; scheduling; set-related o作者: peak-flow 時(shí)間: 2025-3-28 08:34 作者: 廣大 時(shí)間: 2025-3-28 11:52
https://doi.org/10.1007/978-3-319-31271-2ngle unit-speed, unit-capacity server to serve as many requests as possible by an overall time limit, and this problem is NP-hard. We show that a natural greedy algorithm, Earliest Deadline First, is a 2-approximation, and this is tight.作者: Contort 時(shí)間: 2025-3-28 17:56 作者: Criteria 時(shí)間: 2025-3-28 19:58
Twin-Treewidth: A Single-Exponential Logic-Based Approacharameters in parameterized complexity. We demonstrate the usefulness of this parameter by proposing a simple exponential-time generic procedure to solve problems that can be expressed in a fragment of a variant of Second-Order Monadic Logic.作者: 松軟無(wú)力 時(shí)間: 2025-3-29 00:40 作者: 灌輸 時(shí)間: 2025-3-29 04:06
Fabrizio De Santis,Tobias Bauer,Georg Siglh the unconstraint and cardinality constraint settings are studied and the joint assortment, pricing, and advertising problem is also examined. We further extend our findings to account for consumer decision-making patterns.作者: 釋放 時(shí)間: 2025-3-29 08:23
Sergej Proskurin,Michael Wei?,Georg Sigld Albert’s model with Kleinberg’s model, and experimentally showed that the resulting model outperformed Kleinberg’s greedy routing performance on U.S. road networks. While they displayed impressive empirical results, they did not provide any theoretical analysis of their model. In this paper, we fi作者: narcissism 時(shí)間: 2025-3-29 11:56 作者: Epidural-Space 時(shí)間: 2025-3-29 18:40
https://doi.org/10.1007/978-3-662-61136-4mation hiding by integrating a modified blindness filtering technique into ciphertext policy attribute-based encryption under the multi-keyword search model. To minimize communication costs in the ciphertext transmission process, we utilize a super-increasing sequence to aggregate multiple blinding 作者: narcissism 時(shí)間: 2025-3-29 22:14
When Advertising Meets Assortment Planning: Joint Advertising and?Assortment Optimization Under Multh the unconstraint and cardinality constraint settings are studied and the joint assortment, pricing, and advertising problem is also examined. We further extend our findings to account for consumer decision-making patterns.作者: 價(jià)值在貶值 時(shí)間: 2025-3-30 02:58
Highway Preferential Attachment Models for?Geographic Routingd Albert’s model with Kleinberg’s model, and experimentally showed that the resulting model outperformed Kleinberg’s greedy routing performance on U.S. road networks. While they displayed impressive empirical results, they did not provide any theoretical analysis of their model. In this paper, we fi作者: 招待 時(shí)間: 2025-3-30 08:01
A Two-Stage Seeds Algorithm for?Competitive Influence Maximization Considering User Demandommunity Structure (DIACS) algorithm is proposed, which utilizes the characteristics of community structure and dual-influence of nodes to select candidate seeds and maximize the influence of a competitor. We test our algorithm on four real-world datasets and show that it outperforms state-of-the-ar作者: 外科醫(yī)生 時(shí)間: 2025-3-30 09:00
Practical Attribute-Based Multi-keyword Search Scheme with?Sensitive Information Hiding for?Cloud Stmation hiding by integrating a modified blindness filtering technique into ciphertext policy attribute-based encryption under the multi-keyword search model. To minimize communication costs in the ciphertext transmission process, we utilize a super-increasing sequence to aggregate multiple blinding 作者: critique 時(shí)間: 2025-3-30 14:23 作者: 眼界 時(shí)間: 2025-3-30 19:54 作者: 他日關(guān)稅重重 時(shí)間: 2025-3-30 22:13
Twin-Treewidth: A Single-Exponential Logic-Based Approachrameters, such as neighborhood diversity, twin-cover, twin-width, and modular width. In this work, we introduce a new parameter in graphs called twin-treewidth, which explores the equivalence classes of twins. This parameter generalizes treewidth and neighborhood diversity, two of the most studied p作者: CANE 時(shí)間: 2025-3-31 01:51
Highway Preferential Attachment Models for?Geographic Routing acquaintances between any two arbitrary people, but that these arbitrary strangers are able to find these short chains. This phenomenon, known as the ., is explained in part by any model that has a low diameter, such as the Barabási and Albert’s . model, but these models do not display the same eff作者: Gleason-score 時(shí)間: 2025-3-31 06:19
