Frontiers in algorithmics and algorithmic aspects in information and management [electronic resource] : joint international conference, FAW-AAIM 2012, Beijing, China, May 14-16, 2012. Proceedings / Jack Snoeyink, Pinyan Lu, Kaile Su, Lusheng Wang (eds.)
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 presente...
Saved in:
| Online Access: |
Full Text (via Springer) |
|---|---|
| Corporate Author: | |
| Other Authors: | |
| Other title: | FAW-AAIM 2012. |
| Format: | Electronic Conference Proceeding eBook |
| Language: | English |
| Published: |
Berlin ; New York :
Springer,
©2012.
|
| Series: | Lecture notes in computer science ;
7285. LNCS sublibrary. Theoretical computer science and general issues. |
| Subjects: |
MARC
| LEADER | 00000cam a2200000xa 4500 | ||
|---|---|---|---|
| 001 | b7110849 | ||
| 006 | m o d | ||
| 007 | cr ||||||||||| | ||
| 008 | 120509s2012 gw ob 101 0 eng d | ||
| 005 | 20240418144334.9 | ||
| 019 | |a 793220332 |a 1126411304 |a 1136201136 |a 1144345264 |a 1161060174 | ||
| 020 | |a 9783642297007 |q (electronic bk.) | ||
| 020 | |a 3642297005 |q (electronic bk.) | ||
| 020 | |a 3642296998 |q (print) | ||
| 020 | |a 9783642296994 |q (print) | ||
| 020 | |z 9783642296994 | ||
| 024 | 7 | |a 10.1007/978-3-642-29700-7 | |
| 035 | |a (OCoLC)spr793342290 | ||
| 035 | |a (OCoLC)793342290 |z (OCoLC)793220332 |z (OCoLC)1126411304 |z (OCoLC)1136201136 |z (OCoLC)1144345264 |z (OCoLC)1161060174 | ||
| 037 | |a spr978-3-642-29700-7 | ||
| 040 | |a GW5XE |b eng |e pn |c GW5XE |d VRC |d COO |d UKMGB |d ZMC |d OCLCQ |d E7B |d OCLCF |d BEDGE |d VT2 |d OCLCO |d OCLCA |d NLGGC |d YDXCP |d OCL |d OCLCO |d OCLCQ |d EBLCP |d OCLCQ |d ESU |d OCLCQ |d IOG |d NJR |d CEF |d U3W |d WYU |d YOU |d TKN |d LEAUB |d OCLCQ |d WURST |d SFB |d LUN |d AJS |d OCLCQ | ||
| 049 | |a GWRE | ||
| 050 | 4 | |a QA76.9.A43 |b F39 2012eb | |
| 111 | 2 | |a FAW-AAIM (Conference) |d (2012 : |c Beijing, China) |0 http://id.loc.gov/authorities/names/nb2012012550. | |
| 245 | 1 | 0 | |a Frontiers in algorithmics and algorithmic aspects in information and management |h [electronic resource] : |b joint international conference, FAW-AAIM 2012, Beijing, China, May 14-16, 2012. Proceedings / |c Jack Snoeyink, Pinyan Lu, Kaile Su, Lusheng Wang (eds.) |
| 246 | 3 | |a FAW-AAIM 2012. | |
| 260 | |a Berlin ; |a New York : |b Springer, |c ©2012. | ||
| 300 | |a 1 online resource (xvii, 370 pages) | ||
| 336 | |a text |b txt |2 rdacontent. | ||
| 337 | |a computer |b c |2 rdamedia. | ||
| 338 | |a online resource |b cr |2 rdacarrier. | ||
| 490 | 1 | |a Lecture notes in computer science, |x 0302-9743 ; |v 7285. | |
| 490 | 1 | |a LNCS sublibrary. SL 1, Theoretical computer science and general issues. | |
| 504 | |a Includes bibliographical references and author index. | ||
| 505 | 0 | 0 | |t Optimal Binary Representation of Mosaic Floorplans and Baxter Permutations / |r Bryan He -- |t Succinct Strictly Convex Greedy Drawing of 3-Connected Plane Graphs / |r Jiun-Jie Wang and Xin He -- |t Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance / |r Longcheng Liu, Yong Chen, Biao Wu and Enyu Yao -- |t Voronoi Diagram with Visual Restriction / |r Chenglin Fan, Jun Luo, Wencheng Wang and Binhai Zhu -- |t Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region / |r Xuehou Tan and Bo Jiang -- |t On Covering Points with Minimum Turns / |r Minghui Jiang -- |t On Envy-Free Pareto Efficient Pricing / |r Xia Hua -- |t Online Pricing for Multi-type of Items / |r Yong Zhang, Francis Y.L. Chin and Hing-Fung Ting -- |t Algorithms with Limited Number of Preemptions for Scheduling on Parallel Machines / |r Yiwei Jiang, Zewei Weng and Jueliang Hu -- |t Computing Maximum Non-crossing Matching in Convex Bipartite Graphs / |r Danny Z. Chen, Xiaomin Liu and Haitao Wang -- |t Algorithms for Bandwidth Consecutive Multicolorings of Graphs / |r (Extended Abstract) / |r Kazuhide Nishikawa, Takao Nishizeki and Xiao Zhou. |
| 505 | 0 | 0 | |t Independent Domination on Tree Convex Bipartite Graphs / |r Yu Song, Tian Liu and Ke Xu -- |t On-Line Scheduling of Parallel Jobs in Heterogeneous Multiple Clusters / |r Deshi Ye and Lili Mei -- |t On Multiprocessor Temperature-Aware Scheduling Problems / |r Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Evangelos Markakis and Ioannis Milis -- |t Online Minimum Makespan Scheduling with a Buffer / |r Yan Lan, Xin Chen, Ning Ding, György Dósa and Xin Han -- |t A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing / |r Richard Beigel and Bin Fu -- |t Multivariate Polynomial Integration and Differentiation Are Polynomial Time Inapproximable Unless P=NP / |r Bin Fu -- |t Some Remarks on the Incompressibility of Width-Parameterized SAT Instances / |r Bangsheng Tang -- |t Kernels for Packing and Covering Problems / |r (Extended Abstract) / |r Jianer Chen, Henning Fernau, Peter Shaw, Jianxin Wang and Zhibiao Yang -- |t The Worst-Case Upper Bound for Exact 3-Satisfiability with the Number of Clauses as the Parameter / |r Junping Zhou and Minghao Yin -- |t Fixed-Parameter Tractability of almost CSP Problem with Decisive Relations / |r Chihao Zhang and Hongyang Zhang -- |t On Editing Graphs into 2-Club Clusters / |r Hong Liu, Peng Zhang and Daming Zhu. |
| 505 | 0 | 0 | |t Solving Generalized Optimization Problems Subject to SMT Constraints / |r Feifei Ma, Jun Yan and Jian Zhang -- |t Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition / |r Yanyan Xu, Wei Chen, Kaile Su and Wenhui Zhang -- |t Zero-Sum Flow Numbers of Regular Graphs / |r Tao-Ming Wang and Shih-Wei Hu -- |t More Efficient Parallel Integer Sorting / |r Yijie Han and Xin He -- |t Fast Relative Lempel-Ziv Self-index for Similar Sequences / |r Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane and Wing-Kin Sung -- |t A Comparison of Performance Measures via Online Search / |r Joan Boyar, Kim S. Larsen and Abyayananda Maiti -- |t Online Exploration of All Vertices in a Simple Polygon / |r Yuya Higashikawa and Naoki Katoh -- |t In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs / |r Minati De, Subhas C. Nandy and Sasanka Roy -- |t The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs / |r Ton Kloks, Sheung-Hung Poon, Feng-Ren Tsai and Yue-Li Wang -- |t An Improved Approximation Algorithm for the Bandpass Problem / |r Weitian Tong, Randy Goebel, Wei Ding and Guohui Lin -- |t Partial Degree Bounded Edge Packing Problem / |r Peng Zhang -- |t Erratum: The Approximability of the Exemplar Breakpoint Distance Problem / |r Zhixiang Chen, Bin Fu and Binhai Zhu. |
| 520 | |a 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. | ||
| 546 | |a English. | ||
| 650 | 0 | |a Computer algorithms |v Congresses. |0 http://id.loc.gov/authorities/subjects/sh2008101223. | |
| 650 | 0 | |a Combinatorial analysis |v Congresses. |0 http://id.loc.gov/authorities/subjects/sh2008101218. | |
| 650 | 7 | |a Combinatorial analysis. |2 fast |0 (OCoLC)fst00868961. | |
| 650 | 7 | |a Computer algorithms. |2 fast |0 (OCoLC)fst00872010. | |
| 655 | 7 | |a Conference papers and proceedings. |2 fast |0 (OCoLC)fst01423772. | |
| 700 | 1 | |a Snoeyink, Jack. |0 http://id.loc.gov/authorities/names/n2001012777 |1 http://isni.org/isni/0000000034393632. | |
| 776 | 0 | 8 | |i Printed edition: |z 9783642296994. |
| 830 | 0 | |a Lecture notes in computer science ; |v 7285. |0 http://id.loc.gov/authorities/names/n42015162. | |
| 830 | 0 | |a LNCS sublibrary. |n SL 1, |p Theoretical computer science and general issues. |0 http://id.loc.gov/authorities/names/no2007042902. | |
| 856 | 4 | 0 | |u https://colorado.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-642-29700-7 |z Full Text (via Springer) |
| 907 | |a .b7110849x |b 04-01-21 |c 05-22-12 | ||
| 998 | |a web |b 03-31-21 |c b |d b |e - |f eng |g gw |h 0 |i 1 | ||
| 907 | |a .b7110849x |b 03-31-21 |c 05-22-12 | ||
| 944 | |a MARS - RDA ENRICHED | ||
| 956 | |b Springer Nature - Springer Computer Science eBooks 2012 English International | ||
| 915 | |a - | ||
| 956 | |a Springer e-books | ||
| 956 | |b Springer Nature - Springer Computer Science eBooks 2012 English International | ||
| 999 | f | f | |i c1ef0bde-7d43-5291-84ec-64ee891efeee |s 39c6a833-271f-5122-b43a-fd48be4190fb |
| 952 | f | f | |p Can circulate |a University of Colorado Boulder |b Online |c Online |d Online |e QA76.9.A43 F39 2012eb |h Library of Congress classification |i Ebooks, Prospector |n 1 |