コンテンツへ移動
Algorithms and complexity : 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings 資料のプレビュー
閉じる資料のプレビュー
確認中…

Algorithms and complexity : 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings

著者: P G Spirakis; Maria Serna
出版: Berlin ; New York : Springer, ©2013.
シリーズ: Lecture notes in computer science, 7878.; LNCS sublibrary., SL 1,, Theoretical computer science and general issues.
エディション/フォーマット:   電子書籍 : Document : Conference publication : Englishすべてのエディションとフォーマットを見る
データベース:WorldCat
概要:
This book constitutes the refereed conference proceedings of the 8th International Conference on Algorithms and Complexity, CIAC 2013, held in Barcelona, Spain, during May 22-24, 2013. The 31 revised full papers presented were carefully reviewed and selected from 75 submissions. The papers present current research in all aspects of computational complexity and the use, design, analysis and experimentation of  続きを読む
評価:

(まだ評価がありません) 0 件のレビュー - 是非あなたから!

件名:
関連情報:

 

オンラインで入手

この資料へのリンク

オフラインで入手

&AllPage.SpinnerRetrieving; この資料の所蔵館を検索中…

詳細

ジャンル/形式: Electronic books
Conference proceedings
Congresses
その他のフォーマット: Printed edition:
資料の種類: Conference publication, Document, インターネット資料
ドキュメントの種類: インターネットリソース, コンピューターファイル
すべての著者/寄与者: P G Spirakis; Maria Serna
ISBN: 9783642382338 3642382339 3642382320 9783642382321
OCLC No.: 844949200
注記: International conference proceedings.
Includes author index.
物理形態: 1 online resource.
コンテンツ: Approximation Algorithms for Disjoint st-Paths with Minimum Activation Cost / Hasna Mohsen Alqahtani, Thomas Erlebach --
Parameterized Complexity and Kernel Bounds for Hard Planning Problems / Christer Bäckström, Peter Jonsson, Sebastian Ordyniak --
Selfish Resource Allocation in Optical Networks / Evangelos Bampas, Aris Pagourtzis, George Pierrakos --
Average Optimal String Matching in Packed Strings / Djamal Belazzougui, Mathieu Raffinot --
Parameterized Complexity of DAG Partitioning / René van Bevern [and others] --
Four Measures of Nonlinearity / Joan Boyar, Magnus Find, René Peralta --
On the Characterization of Plane Bus Graphs / Till Bruckdorfer, Stefan Felsner, Michael Kaufmann --
Online Multi-dimensional Dynamic Bin Packing of Unit-Fraction Items / Mihai Burcea, Prudence W.H. Wong, Fencol C.C. Yung --
A Greedy Approximation Algorithm for Minimum-Gap Scheduling / Marek Chrobak, Uriel Feige, Mohammad Taghi Hajiaghayi --
Exponential Complexity of Satisfiability Testing for Linear-Size Boolean Formulas / Evgeny Dantsin, Alexander Wolpert. Linear Time Distributed Swap Edge Algorithms / Ajoy K. Datta, Lawrence L. Larmore, Linda Pagli --
Decentralized Throughput Scheduling / Jasper de Jong, Marc Uetz, Andreas Wombacher --
New Results on Stabbing Segments with a Polygon / José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero --
Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games / Yann Disser [and others] --
Complexity of Barrier Coverage with Relocatable Sensors in the Plane / Stefan Dobrev, Stephane Durocher, Mohsen Eftekhari --
Succinct Permanent Is NEXP-Hard with Many Hard Instances / Shlomi Dolev, Nova Fandina, Dan Gutfreund --
Money-Based Coordination of Network Packets / Pavlos S. Efraimidis, Remous-Aris Koutsiamanis --
Truthful Many-to-Many Assignment with Private Weights / Bruno Escoffier, Jérôme Monnot, Fanny Pascual --
Competitive Online Clique Clustering / Aleksander Fabijan, Bengt J. Nilsson, Mia Persson --
Optimal Network Decontamination with Threshold Immunity / Paola Flocchini [and others]. Finding All Convex Cuts of a Plane Graph in Cubic Time / Roland Glantz, Henning Meyerhenke --
Shortest Paths with Bundles and Non-additive Weights Is Hard / Paul W. Goldberg, Antony McCabe --
Cliques and Clubs / Petr A. Golovach, Pinar Heggernes, Dieter Kratsch --
List Coloring in the Absence of Two Subgraphs / Petr A. Golovach, Daniël Paulusma --
Query Complexity of Matroids / Raghav Kulkarni, Miklos Santha --
A New Dynamic Graph Structure for Large-Scale Transportation Networks / Georgia Mali, Panagiotis Michail, Andreas Paraskevopoulos --
Capacitated Rank-Maximal Matchings / Katarzyna Paluch --
A Faster CREW PRAM Algorithm for Computing Cartesian Trees / Chung Keung Poon, Hao Yuan --
Advice Complexity of the Online Coloring Problem / Sebastian Seibert, Andreas Sprock, Walter Unger --
Sparse Linear Complementarity Problems / Hanna Sumita, Naonori Kakimura, Kazuhisa Makino --
LP-Rounding Algorithms for the Fault-Tolerant Facility Placement Problem / Li Yan, Marek Chrobak.
シリーズタイトル: Lecture notes in computer science, 7878.; LNCS sublibrary., SL 1,, Theoretical computer science and general issues.
その他のタイトル: CIAC 2013
責任者: Paul G. Spirakis, Maria Serna (eds.).

概要:

This book constitutes the refereed conference proceedings of the 8th International Conference on Algorithms and Complexity, CIAC 2013, held in Barcelona, Spain, during May 22-24, 2013. The 31 revised full papers presented were carefully reviewed and selected from 75 submissions. The papers present current research in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures.

レビュー

ユーザーレビュー
GoodReadsのレビューを取得中…
DOGObooksのレビューを取得中…

タグ

まずはあなたから!
リクエストの確認

あなたは既にこの資料をリクエストしている可能性があります。このリクエストを続行してよろしければ、OK を選択してください。

リンクデータ


<http://www.worldcat.org/oclc/844949200>
library:oclcnum"844949200"
library:placeOfPublication
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:MediaObject
rdf:typeschema:Book
rdf:valueUnknown value: dct
rdf:valueUnknown value: cnp
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:alternateName"CIAC 2013"@en
schema:bookFormatschema:EBook
schema:contributor
schema:contributor
schema:copyrightYear"2013"
schema:creator
schema:datePublished"2013"
schema:description"This book constitutes the refereed conference proceedings of the 8th International Conference on Algorithms and Complexity, CIAC 2013, held in Barcelona, Spain, during May 22-24, 2013. The 31 revised full papers presented were carefully reviewed and selected from 75 submissions. The papers present current research in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/1390383982>
schema:genre"Electronic books"@en
schema:genre"Conference proceedings"@en
schema:inLanguage"en"
schema:isPartOf
schema:isPartOf
schema:name"Algorithms and complexity 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings"@en
schema:publication
schema:publisher
schema:url
schema:workExample
schema:workExample
schema:workExample
wdrs:describedby

Content-negotiable representations

ウインドウを閉じる

WorldCatにログインしてください 

アカウントをお持ちではないですか?簡単に 無料アカウントを作成することができます。.