Computing and Combinatorics : 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part II (Lecture Notes in Computer Science)

個数:

Computing and Combinatorics : 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part II (Lecture Notes in Computer Science)

  • 提携先の海外書籍取次会社に在庫がございます。通常3週間で発送いたします。
    重要ご説明事項
    1. 納期遅延や、ご入手不能となる場合が若干ございます。
    2. 複数冊ご注文の場合、分割発送となる場合がございます。
    3. 美品のご指定は承りかねます。

    ●3Dセキュア導入とクレジットカードによるお支払いについて
  • 【入荷遅延について】
    世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
    おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。
  • ◆画像の表紙や帯等は実物とは異なる場合があります。
  • ◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
    また、洋書販売価格は、ご注文確定時点での日本円価格となります。
    ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。
  • 製本 Paperback:紙装版/ペーパーバック版/ページ数 419 p.
  • 言語 ENG
  • 商品コード 9783031491924

Full Description

This two volume set volume LNCS 14422-14423 constitutes the refereed proceedings of the 29th International Conference, COCOON 2023, held in Hawaii, HI, USA, during December 2023.  

The 60 full papers were carefully reviewed and selected from 146 submissions. They are organized in the following topical sections:

Part I : Combinatorics and Algorithms; Algorithmic Solution in Applications; and Algorithm in Networks.

Part II: Complexity and Approximation; Graph Algorithms; and Applied Algorithms.

Contents

Complexity and Approximation.- Complexity and Enumeration in Models of Genome Rearrangement.- Conditional automatic complexity and its metrics.- Streaming and Query Once Space Complexity of Longest Increasing Subsequence.- Approximating Decision Trees with Priority Hypotheses.- Approximating the $\lambda$-low-density Value.- Exponential Time Complexity of the Complex Weighted Boolean \#CSP.- Hardness and approximation for the star $p$-hub routing cost problem in $\Delta_\beta$-metric graphs.- Graph Algorithms.- Linear Time Algorithms for NP-hard Problems restricted to GaTEx Graphs.- Polynomial Turing Compressions for Some Graph Problems Parameterized by Modular-Width.- Shortest Longest-Path Graph Orientations.- Sink Location Problems in Dynamic Flow Grid Networks.- List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs.- Parameterized Algorithms for Cluster Vertex Deletion on Degree-4 Graphs and General Graphs.- Sum-of-Local-Effects Data Structures for Separable Graphs.- Applied Algorithms.- Variants of Euclidean k-center Clusterings.- Red-black Spanners for Mixed-charging Vehicular Networks.- Self-stabilizing (Delta+1)-Coloring in Sublinear (in Delta) Rounds via Locally-iterative Algorithms.- On Detecting Some Defective Items in Group Testing.- An Efficient Data Analysis Method for Big Data using Multiple-Model Linear Regression.- Multi-Load Agent Path Finding for Online Pickup and Delivery Problem.- Improved Sourcewise Roundtrip Spanners with Constant Stretch.- Randomized Data Partitioning with Efficient Search, Retrieval and Privacy Preservation.- The k edge-vertex domination problem.- Resource-Adaptive Newton's Method for Distributed Learning.- DR-submodular Function Maximization with Adaptive Stepsize.- On the Routing Problems in Graphs with Ordered Forbidden Transitions.- DelayingDecisions and Reservation Costs.- A PTAS Framework for Clustering Problems in Doubling Metrics.- A Physical Zero-knowledge Proof for Sumplete, a Puzzle Generated by Chat GPT.

最近チェックした商品