Campusbibliothek
Normale Ansicht MARC ISBD

Frontiers in algorithmics and algorithmic aspects in information and management joint international conference, FAW-AAIM 2012, Beijing, China, May 14 - 16, 2012 ; proceedings Jack Snoeyink ... (eds.)

Mitwirkende(r): Materialtyp: TextTextVerlagsnummer: 86091339Sprache: Englisch Reihen: ; 728500 | Lecture notes in computer science ; 7285Verlag: Berlin Heidelberg [u.a.] Springer 2012Beschreibung: XVII, 370 S. graph. Darst. 24 cmInhaltstyp:
  • Text
Medientyp:
  • ohne Hilfsmittel zu benutzen
Datenträgertyp:
  • Band
ISBN:
  • 3642296998
  • 9783642296994
Schlagwörter: Genre/Form: Andere physische Formen: Kein Titel; Online-Ausg.: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management; Erscheint auch als: Frontiers in Algorithmics and Algorithmic Aspects in Information and ManagementLOC-Klassifikation:
  • QA76.9.A43
Andere Klassifikation:
  • SS 4800
  • *68-06
  • 90-06
  • 68Wxx
  • 90Bxx
  • 00B25
  • 85.03
  • 85.20
  • 54.10
Online-Ressourcen:
Inhalte:
Optimal Binary Representation of Mosaic Floorplans and Baxter Permutations Bryan He
Independent Domination on Tree Convex Bipartite Graphs Yu Song, Tian Liu and Ke Xu
Solving Generalized Optimization Problems Subject to SMT Constraints Feifei Ma, Jun Yan and Jian Zhang
Succinct Strictly Convex Greedy Drawing of 3-Connected Plane Graphs Jiun-Jie Wang and Xin He
Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance Longcheng Liu, Yong Chen, Biao Wu and Enyu Yao
Voronoi Diagram with Visual Restriction Chenglin Fan, Jun Luo, Wencheng Wang and Binhai Zhu
Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region Xuehou Tan and Bo Jiang
On Covering Points with Minimum Turns Minghui Jiang
On Envy-Free Pareto Efficient Pricing Xia Hua
Online Pricing for Multi-type of Items Yong Zhang, Francis Y. L. Chin and Hing-Fung Ting
Algorithms with Limited Number of Preemptions for Scheduling on Parallel Machines Yiwei Jiang, Zewei Weng and Jueliang Hu
Computing Maximum Non-crossing Matching in Convex Bipartite Graphs Danny Z. Chen, Xiaomin Liu and Haitao Wang
Algorithms for Bandwidth Consecutive Multicolorings of Graphs (Extended Abstract)
On-Line Scheduling of Parallel Jobs in Heterogeneous Multiple Clusters Deshi Ye and Lili Mei
On Multiprocessor Temperature-Aware Scheduling Problems Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Evangelos Markakis and Ioannis Milis
Online Minimum Makespan Scheduling with a Buffer Yan Lan, Xin Chen, Ning Ding, György Dósa and Xin Han
A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing Richard Beigel and Bin Fu
Multivariate Polynomial Integration and Differentiation Are Polynomial Time Inapproximable Unless P=NP Bin Fu
Some Remarks on the Incompressibility of Width-Parameterized SAT Instances Bangsheng Tang
Kernels for Packing and Covering Problems (Extended Abstract)
The Worst-Case Upper Bound for Exact 3-Satisfiability with the Number of Clauses as the Parameter Junping Zhou and Minghao Yin
Fixed-Parameter Tractability of almost CSP Problem with Decisive Relations Chihao Zhang and Hongyang Zhang
On Editing Graphs into 2-Club Clusters Hong Liu, Peng Zhang and Daming Zhu.
Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition Yanyan Xu, Wei Chen, Kaile Su and Wenhui Zhang
Zero-Sum Flow Numbers of Regular Graphs Tao-Ming Wang and Shih-Wei Hu
More Efficient Parallel Integer Sorting Yijie Han and Xin He
Fast Relative Lempel-Ziv Self-index for Similar Sequences Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane and Wing-Kin Sung
A Comparison of Performance Measures via Online Search Joan Boyar, Kim S. Larsen and Abyayananda Maiti
Online Exploration of All Vertices in a Simple Polygon Yuya Higashikawa and Naoki Katoh
In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs Minati De, Subhas C. Nandy and Sasanka Roy
The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs Ton Kloks, Sheung-Hung Poon, Feng-Ren Tsai and Yue-Li Wang
An Improved Approximation Algorithm for the Bandpass Problem Weitian Tong, Randy Goebel, Wei Ding and Guohui Lin
Partial Degree Bounded Edge Packing Problem Peng Zhang
Erratum: The Approximability of the Exemplar Breakpoint Distance Problem Zhixiang Chen, Bin Fu and Binhai Zhu.
Bearbeitungsvermerk:
  • Archivierung/Langzeitarchivierung gewährleistet PEBW
Andere Ausgaben: Erscheint auch als (Online-Ausgabe): / Frontiers in algorithmics and algorithmic aspects in information and management; Erscheint auch als (Online-Ausgabe): / Snoeyink, Jack: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management; Online-Ausg.: / Snoeyink, Jack: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management
Exemplare
Medientyp Aktuelle Bibliothek Sammlung Standort Signatur Status Fälligkeitsdatum Barcode
Buch Buch Gebäude E2 3 (UdS Campusbibliothek für Informatik und Mathematik) Campusbibliothek für Informatik und Mathematik (E2 3) Series (GF) LNCS 7285 (Regal durchstöbern(Öffnet sich unterhalb)) Verfügbar 2200000320315

Literaturangaben

Optimal Binary Representation of Mosaic Floorplans and Baxter Permutations Bryan He

Independent Domination on Tree Convex Bipartite Graphs Yu Song, Tian Liu and Ke Xu

Solving Generalized Optimization Problems Subject to SMT Constraints Feifei Ma, Jun Yan and Jian Zhang

Succinct Strictly Convex Greedy Drawing of 3-Connected Plane Graphs Jiun-Jie Wang and Xin He

Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance Longcheng Liu, Yong Chen, Biao Wu and Enyu Yao

Voronoi Diagram with Visual Restriction Chenglin Fan, Jun Luo, Wencheng Wang and Binhai Zhu

Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region Xuehou Tan and Bo Jiang

On Covering Points with Minimum Turns Minghui Jiang

On Envy-Free Pareto Efficient Pricing Xia Hua

Online Pricing for Multi-type of Items Yong Zhang, Francis Y. L. Chin and Hing-Fung Ting

Algorithms with Limited Number of Preemptions for Scheduling on Parallel Machines Yiwei Jiang, Zewei Weng and Jueliang Hu

Computing Maximum Non-crossing Matching in Convex Bipartite Graphs Danny Z. Chen, Xiaomin Liu and Haitao Wang

Algorithms for Bandwidth Consecutive Multicolorings of Graphs (Extended Abstract)

On-Line Scheduling of Parallel Jobs in Heterogeneous Multiple Clusters Deshi Ye and Lili Mei

On Multiprocessor Temperature-Aware Scheduling Problems Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Evangelos Markakis and Ioannis Milis

Online Minimum Makespan Scheduling with a Buffer Yan Lan, Xin Chen, Ning Ding, György Dósa and Xin Han

A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing Richard Beigel and Bin Fu

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

Some Remarks on the Incompressibility of Width-Parameterized SAT Instances Bangsheng Tang

Kernels for Packing and Covering Problems (Extended Abstract)

The Worst-Case Upper Bound for Exact 3-Satisfiability with the Number of Clauses as the Parameter Junping Zhou and Minghao Yin

Fixed-Parameter Tractability of almost CSP Problem with Decisive Relations Chihao Zhang and Hongyang Zhang

On Editing Graphs into 2-Club Clusters Hong Liu, Peng Zhang and Daming Zhu.

Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition Yanyan Xu, Wei Chen, Kaile Su and Wenhui Zhang

Zero-Sum Flow Numbers of Regular Graphs Tao-Ming Wang and Shih-Wei Hu

More Efficient Parallel Integer Sorting Yijie Han and Xin He

Fast Relative Lempel-Ziv Self-index for Similar Sequences Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane and Wing-Kin Sung

A Comparison of Performance Measures via Online Search Joan Boyar, Kim S. Larsen and Abyayananda Maiti

Online Exploration of All Vertices in a Simple Polygon Yuya Higashikawa and Naoki Katoh

In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs Minati De, Subhas C. Nandy and Sasanka Roy

The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs Ton Kloks, Sheung-Hung Poon, Feng-Ren Tsai and Yue-Li Wang

An Improved Approximation Algorithm for the Bandpass Problem Weitian Tong, Randy Goebel, Wei Ding and Guohui Lin

Partial Degree Bounded Edge Packing Problem Peng Zhang

Erratum: The Approximability of the Exemplar Breakpoint Distance Problem Zhixiang Chen, Bin Fu and Binhai Zhu.

Frontiers in algorithmics and algorithmic aspects in information and management

Snoeyink, Jack: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management

Snoeyink, Jack: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management

Archivierung/Langzeitarchivierung gewährleistet PEBW pdager DE-31

Impressum

Datenschutzhinweise

© 2023 Campusbibliothek für Informatik und Mathematik | GWDG

Powered by Koha