Combinatorial Optimization and Applications: Proceedings - Lecture Notes in Computer Science - Weili Wu - 書籍 - Springer-Verlag Berlin and Heidelberg Gm - 9783642174605 - 2010年12月9日
カバー画像とタイトルが一致しない場合、正しいのはタイトルです

Combinatorial Optimization and Applications: Proceedings - Lecture Notes in Computer Science


商品が入荷したらメールで通知を受け取る
プロフィールはありますか? ログイン
Weili Wu の新しいリリースのお知らせを受け取る
iMusicのウィッシュリストに追加

まだ評価がありません

Constitutes the refereed proceedings of the 4th International Conference on Combinatorial Optimization and Applications, COCOA 2010, held in Kailua-Kona, HI, USA, in December 2010.


Marc Notes: Includes bibliographical references and index. Table of Contents: Coverage with k-Transmitters in the Presence of Obstacles / Brad Ballinger, Nadia Benbernou, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristan, Diane Souvaine, Ryuhei Uehara -- On Symbolic OBDD-Based Algorithms for the Minimum Spanning Tree Problem / Beate Bollig -- Reducing the Maximum Latency of Selfish Ring Routing via Pairwise Cooperations / Xujin Chen, Xiaodong Hu, Weidong Ma -- Constrained Surface-Level Gateway Placement for Underwater Acoustic Wireless Sensor Networks / Deying Li, Zheng Li, Wenkai Ma, Hong Chen -- Time Optimal Algorithms for Black Hole Search in Rings / Balasingham Balamohan, Paola Flocchini, Ali Miri, Nicola Santoro -- Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded Angle / Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Jaroslav Opatrny, Oscar Morales Ponce, Ladislav Stacho -- A Constant-Factor Approximation Algorithm for the Link Building Problem / Martin Olsen, Anastasios Viglas, Ilia Zvedeniouk -- XML Reconstruction View Selection in XML Databases: Complexity Analysis and Approximation Scheme / Artem Chebotko, Bin Fu -- Computational Study for Planar Connected Dominating Set Problem / Marjan Marzban, Qian-Ping Gu, Xiaohua Jia -- Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives / Peter Damaschke, Azam Sheikh Muhammad -- A Search-Based Approach to the Railway Rolling Stock Allocation Problem / Tomoshi Otsuki, Hideyuki Aisu, Toshiaki Tanaka -- Approximation Algorithm for the Minimum Directed Tree Cover / Viet Hung Nguyen -- An Improved Approximation Algorithm for Spanning Star Forest in Dense Graphs / Jing He, Hongyu Liang -- A New Result on [k, k]1]-Factors Containing Given Hamiltonian Cycles / Guizhen Liu, Xuejun Pan, Jonathan Z. Sun -- Yao Graphs Span Theta Graphs / Mirela Damian, Kristin Raudonis -- A Simpler Algorithm for the All Pairs Shortest Path Problem with O(n2 log n) Expected Time / Tadao Takaoka, Mashitoh Hashim -- New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs / Arthur H. Busch, Feodor F. Dragan, R. Sritharan -- A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem / Bang Ye Wu -- Fast Edge-Searching and Related Problems / Boting Yang -- Diameter-Constrained Steiner Tree / Wei Ding, Guohui Lin, Guoliang Xue -- Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks / Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra -- A Divide-and-Conquer Algorithm for Computing a Most Reliable Source on an Unreliable Ring-Embedded Tree / Wei Ding, Guoliang Xue -- Constrained Low-Interference Relay Node Deployment for Underwater Acoustic Wireless Sensor Networks / Deying Li, Zheng Li, Wenkai Ma, Wenping Chen -- Structured Overlay Network for File Distribution / Hongbing Fan, Yu-Liang Wu -- Optimal Balancing of Satellite Queues in Packet Transmission to Ground Stations / Evangelos Kranakis, Danny Krizanc, Ioannis Lambadaris, Lata Narayanan, Jaroslav Opatrny -- The Networked Common Goods Game / Jinsong Tan -- A Novel Branching Strategy for Parameterized Graph Modification Problems / James Nastos, Yong Gao -- Listing Triconnected Rooted Plane Graphs / Bingbing Zhuang, Hiroshi Nagamochi -- Bipartite Permutation Graphs Are Reconstructible / Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara -- A Transformation from PPTL to S1S / Cong Tian, Zhenhua Duan -- Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs / Mingyu Xiao -- Approximate Ellipsoid in the Streaming Model / Asish Mukhopadhyay, Animesh Sarker, Tom Switzer -- Author Index.

メディア 書籍     Paperback Book   (ソフトカバーで背表紙を接着した本)
リリース済み 2010年12月9日
ISBN13 9783642174605
出版社 Springer-Verlag Berlin and Heidelberg Gm
ページ数 416
寸法 155 × 236 × 25 mm   ·   635 g
言語 フランス語  
編集者 Daescu, Ovidiu
編集者 Wu, Weili

Weili Wuの他の作品を見る

すべて表示

このシリーズの他の商品

同じ出版社からのその他の記事