Experimental and Efficient Algorithms: 4th International Workshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005, Proceedings (Google eBook)
Springer Science & Business Media, Apr 28, 2005 - Computers - 624 pages
This proceedings volume contains the accepted papers and invited talks p- sented at the 4th International Workshop of E?cient and Experimental Al- rithms (WEA 2005), that was held May 10–13, on Santorini Island, Greece. The WEA events are intended to be an international forum for research on the design, analysis and especially the experimental implementation, evaluation and engineering of algorithms, as well as on combinatorial optimization and its applications. The?rstthreeworkshopsinthisserieswereheldinRiga(2001),MonteVerita (2003) and Rio de Janeiro (2004). Thisvolumecontains3invitedpapersrelatedtocorrespondingkeynotetalks: by Prof. Christos Papadimitriou (University of California at Berkeley, USA), Prof. David Bader (University of New Mexico, USA) and Prof. Celso Ribeiro (University of Rio de Janeiro, Brazil). This proceedings includes 54 papers (47 regular and 7 short), selected out of a record number of 176 submissions. Each paper was reviewed by at least 2 Program Committee members, while many papers got 3 or 4 reviews. A total number of 419 reviews were solicited, with the help of trusted external referees. In addition to the 54 papers included in this volume, 6papers were accepted as poster presentations: these papers were published in a separate poster p- ceedings volume by CTI Press and a major publisher in Greece, “Ellinika Gr- mata.” The presentation of these posters at the event was expected to create a fruitful discussion on interesting ideas.
What people are saying - Write a review
We haven't found any reviews in the usual places.
allocation applications approximation algorithm arc-ﬂags assignment average Berlin Heidelberg 2005 bits buﬀer scheme checkpointing chordal graphs clique colors combinatorial components Computer Science constraints construction cost CPLEX cycle deﬁned Deﬁnition denote diﬀerent distribution edges eﬃcient experimental ﬁnd ﬁnding ﬁrst ﬁxed ﬂow function genetic algorithms given graph G GRASP greedy heuristic implementation initial input instances integer iteration Lemma linear linear program LNCS lower bound matching maximum method minimal minimum Nash equilibrium nodes NP-hard obtained packets parameters partition path computations path-relinking perfect hash function performance permutation graphs player polynomial preﬁxes Proc programming radiocoloring random graphs rectangle running S.E. Nikoletseas satisﬁed scheduling Section sensors sequence server shortest path solve space speciﬁc speed-up split graphs Steiner tree step strategy subgraph subset Table Tabu Search techniques Theorem traﬃc tree treewidth upper bound variables vector vertex cover vertices weights