Computing and Combinatorics : 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012, Proceedings
著者
書誌事項
Computing and Combinatorics : 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012, Proceedings
(Lecture notes in computer science, 7434)
Springer Berlin, c2012
大学図書館所蔵 全4件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references and index
内容説明・目次
内容説明
This book constitutes the refereed proceedings of the 18th Annual International Conference on Computing and Combinatorics, held in Sydney, Australia, in August 2012.
The 50 revised full papers presented were carefully reviewed and selected from 121 submissions. Topics covered are algorithms and data structures; algorithmic game theory and online algorithms; automata, languages, logic, and computability; combinatorics related to algorithms and complexity; complexity theory; computational learning theory and knowledge discovery; cryptography, reliability and security, and database theory; computational biology and bioinformatics; computational algebra, geometry, and number theory; graph drawing and information visualization; graph theory, communication networks, and optimization.
目次
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree.- A Simple D2-Sampling Based PTAS for k-Means and other Clustering Problems.- Speed Scaling for Maximum Lateness.- Induced Subgraph Isomorphism: Are Some Patterns Substantially.- Easier Than Others.- Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs.- Online Knapsack Problem with Removal Cost.- An Improved Exact Algorithm for TSP in Degree-4 Graphs.- Dynamic Programming for H-minor-free Graphs.- Restricted Max-Min Fair Allocations with Inclusion-Free Intervals.- An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks.- Towards Optimal and Expressive Kernelization for d-Hitting Set.-Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs.- A Local Algorithm for Finding Dense Bipartite-Like Subgraphs.- Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs.- On the Minimum Degree Hypergraph Problem with Subset Size Two and the Red-Blue Set Cover Problem with the Consecutive Ones Property.- Rainbow Colouring of Split and Threshold.- Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Succinct Representations of Binary Trees for Range Minimum Queries.
「Nielsen BookData」 より