컨텐츠로 이동
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.
판/형식:   전자도서 : 문서 : 컨퍼런스 간행물 : 영어모든 판과 형식 보기
데이터베이스: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
자료 유형: 컨퍼런스 간행물, 문서, 인터넷 자료
문서 형식: 인터넷 자원, 컴퓨터 파일
모든 저자 / 참여자: P G Spirakis; Maria Serna
ISBN: 9783642382338 3642382339 3642382320 9783642382321
OCLC 번호: 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
owl:sameAs<info:oclcnum/844949200>
rdf:typeschema:Book
schema:about
schema:about
schema:about
<http://id.worldcat.org/fast/872010>
rdf:typeschema:Intangible
schema:name"Computational complexity."@en
schema:name"Computer algorithms"@en
schema:about
schema:about
schema:about
schema:about
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:genre"Conference proceedings."@en
schema:inLanguage"en"
schema:name"Algorithms and complexity 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings"@en
schema:name"CIAC 2013"@en
schema:publisher
schema:url<http://dx.doi.org/10.1007/978-3-642-38233-8>
schema:url
schema:workExample
schema:workExample

Content-negotiable representations

윈도우 닫기

WorldCat에 로그인 하십시오 

계정이 없으세요? 아주 간단한 절차를 통하여 무료 계정을 만드실 수 있습니다.