Atjaunināt sīkdatņu piekrišanu

Frontiers in Algorithmics and Algorithmic Aspects in Information and Management: Joint International Conference, FAW-AAIM 2012, Beijing, China, May 14-16, 2012, Proceedings 2012 ed. [Mīkstie vāki]

Edited by , Edited by , Edited by , Edited by
  • Formāts: Paperback / softback, 370 pages, height x width: 235x155 mm, weight: 592 g, 77 Illustrations, black and white; XVII, 370 p. 77 illus., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 7285
  • Izdošanas datums: 26-Apr-2012
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3642296998
  • ISBN-13: 9783642296994
  • Mīkstie vāki
  • Cena: 46,91 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 55,19 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Paperback / softback, 370 pages, height x width: 235x155 mm, weight: 592 g, 77 Illustrations, black and white; XVII, 370 p. 77 illus., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 7285
  • Izdošanas datums: 26-Apr-2012
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3642296998
  • ISBN-13: 9783642296994
This book constitutes the refereed proceedings of the 6th International Frontiers of Algorithmics Workshop, FAW 2012, and the 8th International Conference on Algorithmic Aspects in Information and Management, AAIM 2012, jointly held in Beijing, China, in May 2012. The 33 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 81 submissions. The papers are organized in topical sections on algorithms and data structures, algorithmic game theory and incentive analysis, biomedical imaging algorithms, communication networks and optimization, computational learning theory, knowledge discovery, and data mining, experimental algorithmic methodologies, optimization algorithms in economic and operations research, pattern recognition algorithms and trustworthy algorithms and trustworthy software.
Optimal Binary Representation of Mosaic Floorplans and Baxter Permutations
1(12)
Bryan He
Succinct Strictly Convex Greedy Drawing of 3-Connected Plane Graphs
13(13)
Jiun-Jie Wang
Xin He
Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance
26(10)
Longcheng Liu
Yong Chen
Biao Wu
Enyu Yao
Voronoi Diagram with Visual Restriction
36(11)
Chenglin Fan
Jun Luo
Wencheng Wang
Binhai Zhu
Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region
47(11)
Xuehou Tan
Bo Jiang
On Covering Points with Minimum Turns
58(12)
Minghui Jiang
On Envy-Free Pareto Efficient Pricing
70(12)
Xia Hua
Online Pricing for Multi-type of Items
82(11)
Yong Zhang
Francis Y.L. Chin
Hing-Fung Ting
Algorithms with Limited Number of Preemptions for Scheduling on Parallel Machines
93(12)
Yiwei Jiang
Zewei Weng
Jueliang Hu
Computing Maximum Non-crossing Matching in Convex Bipartite Graphs
105(12)
Danny Z. Chen
Xiaomin Liu
Haitao Wang
Algorithms for Bandwidth Consecutive Multicolorings of Graphs (Extended Abstract)
117(12)
Kazuhide Nishikawa
Takao Nishizeki
Xiao Zhou
Independent Domination on Tree Convex Bipartite Graphs
129(10)
Yu Song
Tian Liu
Ke Xu
On-Line Scheduling of Parallel Jobs in Heterogeneous Multiple Clusters
139(10)
Deshi Ye
Lili Mei
On Multiprocessor Temperature-Aware Scheduling Problems
149(12)
Evripidis Bampis
Dimitrios Letsios
Giorgio Lucarelli
Evangelos Markakis
Ioannis Milis
Online Minimum Makespan Scheduling with a Buffer
161(11)
Yan Lan
Xin Chen
Ning Ding
Gyorgy Dosa
Xin Han
A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing
172(10)
Richard Beigel
Bin Fu
Multivariate Polynomial Integration and Differentiation Are Polynomial Time Inapproximable Unless P=NP
182(10)
Bin Fu
Some Remarks on the Incompressibility of Width-Parameterized SAT Instances
192(7)
Bangsheng Tang
Kernels for Packing and Covering Problems (Extended Abstract)
199(13)
Jianer Chen
Henning Fernau
Peter Shaw
Jianxin Wang
Zhibiao Yang
The Worst-Case Upper Bound for Exact 3-Satisfiability with the Number of Clauses as the Parameter
212(12)
Junping Zhou
Minghao Yin
Fixed-Parameter Tractability of almost CSP Problem with Decisive Relations
224(11)
Chihao Zhang
Hongyang Zhang
On Editing Graphs into 2-Club Clusters
235(12)
Hong Liu
Peng Zhang
Daming Zhu
Solving Generalized Optimization Problems Subject to SMT Constraints
247(12)
Feifei Ma
Jun Yan
Jian Zhang
Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition
259(10)
Yanyan Xu
Wei Chen
Kaile Su
Wenhui Zhang
Zero-Sum Flow Numbers of Regular Graphs
269(10)
Tao-Ming Wang
Shih-Wei Hu
More Efficient Parallel Integer Sorting
279(12)
Yijie Han
Xin He
Fast Relative Lempel-Ziv Self-index for Similar Sequences
291(12)
Huy Hoang Do
Jesper Jansson
Kunihiko Sadakane
Wing-Kin Sung
A Comparison of Performance Measures via Online Search
303(12)
Joan Boyar
Kim S. Larsen
Abyayananda Maiti
Online Exploration of All Vertices in a Simple Polygon
315(12)
Yuya Higashikawa
Naoki Katoh
In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs
327(12)
Minati De
Subhas C. Nandy
Sasanka Roy
The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs
339(12)
Ton Kloks
Sheung-Hung Poon
Feng-Ren Tsai
Yue-Li Wang
An Improved Approximation Algorithm for the Bandpass Problem
351(8)
Weitian Tong
Randy Goebel
Wei Ding
Guohui Lin
Partial Degree Bounded Edge Packing Problem
359(9)
Peng Zhang
Erratum: The Approximability of the Exemplar Breakpoint Distance Problem
368(1)
Zhixiang Chen
Bin Fu
Binhai Zhu
Author Index 369