aller au contenu
Algorithms and complexity : 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings Aperçu de cet ouvrage
FermerAperçu de cet ouvrage
Vérifiant…

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

Auteur : P G Spirakis; Maria Serna
Éditeur : Berlin ; New York : Springer, ©2013.
Collection : Lecture notes in computer science, 7878.; LNCS sublibrary., SL 1,, Theoretical computer science and general issues.
Édition/format :   Livre électronique : Document : Publication de conférence : AnglaisVoir toutes les éditions et les formats
Base de données :WorldCat
Résumé :
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  Lire la suite...
Évaluation :

(pas encore évalué) 0 avec des critiques - Soyez le premier.

Sujets
Plus comme ceci

 

Trouver un exemplaire en ligne

Liens vers cet ouvrage

Trouver un exemplaire dans la bibliothèque

&AllPage.SpinnerRetrieving; Recherche de bibliothèques qui possèdent cet ouvrage...

Détails

Genre/forme : Electronic books
Conference proceedings
Congresses
Type d’ouvrage : Publication de conférence, Document, Ressource Internet
Format : Ressource Internet, Fichier informatique
Tous les auteurs / collaborateurs : P G Spirakis; Maria Serna
ISBN : 9783642382338 3642382339 3642382320 9783642382321
Numéro OCLC : 844949200
Notes : International conference proceedings.
Includes author index.
Description : 1 online resource.
Contenu : 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.
Titre de collection : Lecture notes in computer science, 7878.; LNCS sublibrary., SL 1,, Theoretical computer science and general issues.
Autres titres : CIAC 2013
Responsabilité : Paul G. Spirakis, Maria Serna (eds.).
Plus d’informations :

Résumé :

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.

Critiques

Critiques d’utilisateurs
Récupération des critiques de GoodReads...
Récuperation des critiques DOGObooks…

Tags

Soyez le premier.
Confirmez cette demande

Vous avez peut-être déjà demandé cet ouvrage. Veuillez sélectionner OK si vous voulez poursuivre avec cette demande quand même.

Données liées


<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

Fermer la fenêtre

Veuillez vous identifier dans WorldCat 

Vous n’avez pas de compte? Vous pouvez facilement créer un compte gratuit.