Skip to main content

Über dieses Buch

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.



2012 | OriginalPaper | Buchkapitel

Optimal Binary Representation of Mosaic Floorplans and Baxter Permutations

Bryan He

2012 | OriginalPaper | Buchkapitel

Succinct Strictly Convex Greedy Drawing of 3-Connected Plane Graphs

Jiun-Jie Wang, Xin He

2012 | OriginalPaper | Buchkapitel

Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance

Longcheng Liu, Yong Chen, Biao Wu, Enyu Yao

2012 | OriginalPaper | Buchkapitel

Voronoi Diagram with Visual Restriction

Chenglin Fan, Jun Luo, Wencheng Wang, Binhai Zhu

2012 | OriginalPaper | Buchkapitel

Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region

Xuehou Tan, Bo Jiang

2012 | OriginalPaper | Buchkapitel

On Covering Points with Minimum Turns

Minghui Jiang

2012 | OriginalPaper | Buchkapitel

On Envy-Free Pareto Efficient Pricing

Xia Hua

2012 | OriginalPaper | Buchkapitel

Online Pricing for Multi-type of Items

Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting

2012 | OriginalPaper | Buchkapitel

Algorithms with Limited Number of Preemptions for Scheduling on Parallel Machines

Yiwei Jiang, Zewei Weng, Jueliang Hu

2012 | OriginalPaper | Buchkapitel

Computing Maximum Non-crossing Matching in Convex Bipartite Graphs

Danny Z. Chen, Xiaomin Liu, Haitao Wang

2012 | OriginalPaper | Buchkapitel

Algorithms for Bandwidth Consecutive Multicolorings of Graphs

(Extended Abstract)
Kazuhide Nishikawa, Takao Nishizeki, Xiao Zhou

2012 | OriginalPaper | Buchkapitel

Independent Domination on Tree Convex Bipartite Graphs

Yu Song, Tian Liu, Ke Xu

2012 | OriginalPaper | Buchkapitel

On-Line Scheduling of Parallel Jobs in Heterogeneous Multiple Clusters

Deshi Ye, Lili Mei

2012 | OriginalPaper | Buchkapitel

On Multiprocessor Temperature-Aware Scheduling Problems

Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Evangelos Markakis, Ioannis Milis

2012 | OriginalPaper | Buchkapitel

Online Minimum Makespan Scheduling with a Buffer

Yan Lan, Xin Chen, Ning Ding, György Dósa, Xin Han

2012 | OriginalPaper | Buchkapitel

A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing

Richard Beigel, Bin Fu

2012 | OriginalPaper | Buchkapitel

Multivariate Polynomial Integration and Differentiation Are Polynomial Time Inapproximable Unless P=NP

Bin Fu

2012 | OriginalPaper | Buchkapitel

Some Remarks on the Incompressibility of Width-Parameterized SAT Instances

Bangsheng Tang

2012 | OriginalPaper | Buchkapitel

Kernels for Packing and Covering Problems

(Extended Abstract)
Jianer Chen, Henning Fernau, Peter Shaw, Jianxin Wang, Zhibiao Yang

2012 | OriginalPaper | Buchkapitel

The Worst-Case Upper Bound for Exact 3-Satisfiability with the Number of Clauses as the Parameter

Junping Zhou, Minghao Yin

2012 | OriginalPaper | Buchkapitel

Fixed-Parameter Tractability of almost CSP Problem with Decisive Relations

Chihao Zhang, Hongyang Zhang

2012 | OriginalPaper | Buchkapitel

On Editing Graphs into 2-Club Clusters

Hong Liu, Peng Zhang, Daming Zhu

2012 | OriginalPaper | Buchkapitel

Solving Generalized Optimization Problems Subject to SMT Constraints

Feifei Ma, Jun Yan, Jian Zhang

2012 | OriginalPaper | Buchkapitel

Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition

Yanyan Xu, Wei Chen, Kaile Su, Wenhui Zhang

2012 | OriginalPaper | Buchkapitel

Zero-Sum Flow Numbers of Regular Graphs

Tao-Ming Wang, Shih-Wei Hu

2012 | OriginalPaper | Buchkapitel

More Efficient Parallel Integer Sorting

Yijie Han, Xin He

2012 | OriginalPaper | Buchkapitel

Fast Relative Lempel-Ziv Self-index for Similar Sequences

Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung

2012 | OriginalPaper | Buchkapitel

A Comparison of Performance Measures via Online Search

Joan Boyar, Kim S. Larsen, Abyayananda Maiti

2012 | OriginalPaper | Buchkapitel

Online Exploration of All Vertices in a Simple Polygon

Yuya Higashikawa, Naoki Katoh

2012 | OriginalPaper | Buchkapitel

In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs

Minati De, Subhas C. Nandy, Sasanka Roy

2012 | OriginalPaper | Buchkapitel

The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs

Ton Kloks, Sheung-Hung Poon, Feng-Ren Tsai, Yue-Li Wang

2012 | OriginalPaper | Buchkapitel

An Improved Approximation Algorithm for the Bandpass Problem

Weitian Tong, Randy Goebel, Wei Ding, Guohui Lin

2012 | OriginalPaper | Buchkapitel

Partial Degree Bounded Edge Packing Problem

Peng Zhang

2012 | OriginalPaper | Buchkapitel

Erratum: The Approximability of the Exemplar Breakpoint Distance Problem

Zhixiang Chen, Bin Fu, Binhai Zhu


Weitere Informationen

Premium Partner

Neuer Inhalt

BranchenIndex Online

Die B2B-Firmensuche für Industrie und Wirtschaft: Kostenfrei in Firmenprofilen nach Lieferanten, Herstellern, Dienstleistern und Händlern recherchieren.



Product Lifecycle Management im Konzernumfeld – Herausforderungen, Lösungsansätze und Handlungsempfehlungen

Für produzierende Unternehmen hat sich Product Lifecycle Management in den letzten Jahrzehnten in wachsendem Maße zu einem strategisch wichtigen Ansatz entwickelt. Forciert durch steigende Effektivitäts- und Effizienzanforderungen stellen viele Unternehmen ihre Product Lifecycle Management-Prozesse und -Informationssysteme auf den Prüfstand. Der vorliegende Beitrag beschreibt entlang eines etablierten Analyseframeworks Herausforderungen und Lösungsansätze im Product Lifecycle Management im Konzernumfeld.
Jetzt gratis downloaden!