LEADER 07600nam 22008295 450 001 996465995203316 005 20230222081319.0 010 $a3-642-29700-5 024 7 $a10.1007/978-3-642-29700-7 035 $a(CKB)3360000000366027 035 $a(SSID)ssj0000666108 035 $a(PQKBManifestationID)11476775 035 $a(PQKBTitleCode)TC0000666108 035 $a(PQKBWorkID)10665794 035 $a(PQKB)10621126 035 $a(DE-He213)978-3-642-29700-7 035 $a(MiAaPQ)EBC3070876 035 $a(PPN)168315122 035 $a(EXLCZ)993360000000366027 100 $a20120428d2012 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFrontiers in Algorithmics and Algorithmic Aspects in Information and Management$b[electronic resource] $eJoint International Conference, FAW-AAIM 2012, Beijing, China, May 14-16, 2012, Proceedings /$fedited by Jack Snoeyink, Pinyan Lu, Kaile Su, Lusheng Wang 205 $a1st ed. 2012. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2012. 215 $a1 online resource (XVII, 370 p. 77 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7285 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-29699-8 320 $aIncludes bibliographical references and index. 327 $tOptimal Binary Representation of Mosaic Floorplans and Baxter Permutations /$rBryan He --$tSuccinct Strictly Convex Greedy Drawing of 3-Connected Plane Graphs /$rJiun-Jie Wang and Xin He --$tWeighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance /$rLongcheng Liu, Yong Chen, Biao Wu and Enyu Yao --$tVoronoi Diagram with Visual Restriction /$rChenglin Fan, Jun Luo, Wencheng Wang and Binhai Zhu --$tMinimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region /$rXuehou Tan and Bo Jiang --$tOn Covering Points with Minimum Turns /$rMinghui Jiang --$tOn Envy-Free Pareto Efficient Pricing /$rXia Hua --$tOnline Pricing for Multi-type of Items /$rYong Zhang, Francis Y. L. Chin and Hing-Fung Ting --$tAlgorithms with Limited Number of Preemptions for Scheduling on Parallel Machines /$rYiwei Jiang, Zewei Weng and Jueliang Hu --$tComputing Maximum Non-crossing Matching in Convex Bipartite Graphs /$rDanny Z. Chen, Xiaomin Liu and Haitao Wang --$tAlgorithms for Bandwidth Consecutive Multicolorings of Graphs /$r(Extended Abstract) /$rKazuhide Nishikawa, Takao Nishizeki and Xiao Zhou. 327 $tIndependent Domination on Tree Convex Bipartite Graphs /$rYu Song, Tian Liu and Ke Xu --$tOn-Line Scheduling of Parallel Jobs in Heterogeneous Multiple Clusters /$rDeshi Ye and Lili Mei --$tOn Multiprocessor Temperature-Aware Scheduling Problems /$rEvripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Evangelos Markakis and Ioannis Milis --$tOnline Minimum Makespan Scheduling with a Buffer /$rYan Lan, Xin Chen, Ning Ding, Gyo?rgy Do?sa and Xin Han --$tA Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing /$rRichard Beigel and Bin Fu --$tMultivariate Polynomial Integration and Differentiation Are Polynomial Time Inapproximable Unless P=NP /$rBin Fu --$tSome Remarks on the Incompressibility of Width-Parameterized SAT Instances /$rBangsheng Tang --$tKernels for Packing and Covering Problems /$r(Extended Abstract) /$rJianer Chen, Henning Fernau, Peter Shaw, Jianxin Wang and Zhibiao Yang --$tThe Worst-Case Upper Bound for Exact 3-Satisfiability with the Number of Clauses as the Parameter /$rJunping Zhou and Minghao Yin --$tFixed-Parameter Tractability of almost CSP Problem with Decisive Relations /$rChihao Zhang and Hongyang Zhang --$tOn Editing Graphs into 2-Club Clusters /$rHong Liu, Peng Zhang and Daming Zhu. 327 $tSolving Generalized Optimization Problems Subject to SMT Constraints /$rFeifei Ma, Jun Yan and Jian Zhang --$tSolving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition /$rYanyan Xu, Wei Chen, Kaile Su and Wenhui Zhang --$tZero-Sum Flow Numbers of Regular Graphs /$rTao-Ming Wang and Shih-Wei Hu --$tMore Efficient Parallel Integer Sorting /$rYijie Han and Xin He --$tFast Relative Lempel-Ziv Self-index for Similar Sequences /$rHuy Hoang Do, Jesper Jansson, Kunihiko Sadakane and Wing-Kin Sung --$tA Comparison of Performance Measures via Online Search /$rJoan Boyar, Kim S. Larsen and Abyayananda Maiti --$tOnline Exploration of All Vertices in a Simple Polygon /$rYuya Higashikawa and Naoki Katoh --$tIn-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs /$rMinati De, Subhas C. Nandy and Sasanka Roy --$tThe Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs /$rTon Kloks, Sheung-Hung Poon, Feng-Ren Tsai and Yue-Li Wang --$tAn Improved Approximation Algorithm for the Bandpass Problem /$rWeitian Tong, Randy Goebel, Wei Ding and Guohui Lin --$tPartial Degree Bounded Edge Packing Problem /$rPeng Zhang --$tErratum: The Approximability of the Exemplar Breakpoint Distance Problem /$rZhixiang Chen, Bin Fu and Binhai Zhu. 330 $aThis 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7285 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aComputer science 606 $aElectronic data processing?Management 606 $aArtificial intelligence?Data processing 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aMathematics of Computing 606 $aTheory of Computation 606 $aIT Operations 606 $aData Science 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aComputer science. 615 0$aElectronic data processing?Management. 615 0$aArtificial intelligence?Data processing. 615 14$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aMathematics of Computing. 615 24$aTheory of Computation. 615 24$aIT Operations. 615 24$aData Science. 676 $a005.1 702 $aSnoeyink$b Jack$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLu$b Pinyan$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSu$b Kaile$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aWang$b Lusheng$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aFAW-AAIM 2012 906 $aBOOK 912 $a996465995203316 996 $aFrontiers in Algorithmics and Algorithmic Aspects in Information and Management$92829817 997 $aUNISA