東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Frontiers in algorithmics = 11th Int...

International Frontiers of Algorithmics Workshop (2017 :)

FindBook

Google Book

Amazon

博客來

Frontiers in algorithmics = 11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Frontiers in algorithmics/ edited by Mingyu Xiao, Frances Rosamond.
其他題名:	11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017 : proceedings /
其他題名:	FAW 2017
其他作者:	Xiao, Mingyu.
團體作者:	International Frontiers of Algorithmics Workshop
出版者:	Cham :Springer International Publishing : : 2017.,
面頁冊數:	x, 281 p. :ill., digital ;24 cm.
內容註:	On the Complexity of Minimizing the Total Calibration Cost -- On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model. - The complexity of finding (approximate sized) distance d dominating sets in tournaments -- On Computational Aspects of Greedy Partitioning of Graphs -- Maximum Edge Bicliques in Tree Convex Bipartite Graphs -- Complete Submodularity Characterization in the Comparative Independent Cascade Model -- A Risk-reward Model for On-line Financial Leasing Problem with an Interest Rate -- Designing and Implementing Algorithms for the Closest String Problem -- The Broken-Triangle Property with Adjoint Values -- Online Knapsack Problem under Concave Functions -- Fluctuated Fitting under the L1-metric -- Optimal Partitioning Which Maximizes the Weighted Sum of Products -- Modular-width: An Auxiliary Parameter for Parameterized Parallel Complexity -- Online Strategies for Evacuating from a Convex Region in the Plane -- A further analysis of the dynamic dominant resource fairness mechanism -- A 42k Kernel for the Complementary Maximal Strip Recovery Problem -- On-line Scheduling with a Monotonous Subsequence Constraint -- A 1.4-Approximation Algorithm For Two-sided Scaffold Filling -- FPT algorithms for FVS parameterized by split and cluster vertex deletion sets and other parameters -- A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order -- Geodectic Contraction Games on Trees -- On Approximation Algorithms for Two-Stage Scheduling Problems -- A New Lower Bound for Positive Zero Forcing -- Phase Transition for Maximum Not-All-Equal Satisfiability.
Contained By:	Springer eBooks
標題:	Computer algorithms - Congresses. -
電子資源:	https://doi.org/10.1007/978-3-319-59605-1
ISBN:	9783319596051

Frontiers in algorithmics = 11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017 : proceedings /
Frontiers in algorithmics11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017 : proceedings /[electronic resource] :FAW 2017edited by Mingyu Xiao, Frances Rosamond. - Cham :Springer International Publishing :2017. - x, 281 p. :ill., digital ;24 cm. - Lecture notes in computer science,103360302-9743 ;. - Lecture notes in computer science ;10336..

On the Complexity of Minimizing the Total Calibration Cost -- On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model. - The complexity of finding (approximate sized) distance d dominating sets in tournaments -- On Computational Aspects of Greedy Partitioning of Graphs -- Maximum Edge Bicliques in Tree Convex Bipartite Graphs -- Complete Submodularity Characterization in the Comparative Independent Cascade Model -- A Risk-reward Model for On-line Financial Leasing Problem with an Interest Rate -- Designing and Implementing Algorithms for the Closest String Problem -- The Broken-Triangle Property with Adjoint Values -- Online Knapsack Problem under Concave Functions -- Fluctuated Fitting under the L1-metric -- Optimal Partitioning Which Maximizes the Weighted Sum of Products -- Modular-width: An Auxiliary Parameter for Parameterized Parallel Complexity -- Online Strategies for Evacuating from a Convex Region in the Plane -- A further analysis of the dynamic dominant resource fairness mechanism -- A 42k Kernel for the Complementary Maximal Strip Recovery Problem -- On-line Scheduling with a Monotonous Subsequence Constraint -- A 1.4-Approximation Algorithm For Two-sided Scaffold Filling -- FPT algorithms for FVS parameterized by split and cluster vertex deletion sets and other parameters -- A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order -- Geodectic Contraction Games on Trees -- On Approximation Algorithms for Two-Stage Scheduling Problems -- A New Lower Bound for Positive Zero Forcing -- Phase Transition for Maximum Not-All-Equal Satisfiability.

This book constitutes the proceedings of the 11th International Workshop on Frontiers in Algorithmics, FAW 2017, held in Chengdu, China, in June 2017. The 24 papers presented in this volume were carefully reviewed and selected from 61 submissions. They deal with all aspects of theoretical computer science and algorithms.

ISBN: 9783319596051

Standard No.: 10.1007/978-3-319-59605-1doiSubjects--Topical Terms:

576357
Computer algorithms
--Congresses.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Frontiers in algorithmics = 11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017 : proceedings /
LDR:03170nmm a2200361 a 4500 001 2190849
003 DE-He213
005 20190619212118.0
006 m d
007 cr nn 008maaau
008 200504s2017 gw s 0 eng d
020 $a 9783319596051 $q (electronic bk.)
020 $a 9783319596044 $q (paper)
024 7 $a 10.1007/978-3-319-59605-1 $2 doi
035 $a 978-3-319-59605-1
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
090 $a QA76.9.A43 $b I61 2017
111 2 $a International Frontiers of Algorithmics Workshop $n (11th : $d 2017 : $c Chengdu, China) $3 3409712
245 1 0 $a Frontiers in algorithmics $h [electronic resource] : $b 11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017 : proceedings / $c edited by Mingyu Xiao, Frances Rosamond.
246 3 $a FAW 2017
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2017.
300 $a x, 281 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 10336
490 1 $a Theoretical computer science and general issues
505 0 $a On the Complexity of Minimizing the Total Calibration Cost -- On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model. - The complexity of finding (approximate sized) distance d dominating sets in tournaments -- On Computational Aspects of Greedy Partitioning of Graphs -- Maximum Edge Bicliques in Tree Convex Bipartite Graphs -- Complete Submodularity Characterization in the Comparative Independent Cascade Model -- A Risk-reward Model for On-line Financial Leasing Problem with an Interest Rate -- Designing and Implementing Algorithms for the Closest String Problem -- The Broken-Triangle Property with Adjoint Values -- Online Knapsack Problem under Concave Functions -- Fluctuated Fitting under the L1-metric -- Optimal Partitioning Which Maximizes the Weighted Sum of Products -- Modular-width: An Auxiliary Parameter for Parameterized Parallel Complexity -- Online Strategies for Evacuating from a Convex Region in the Plane -- A further analysis of the dynamic dominant resource fairness mechanism -- A 42k Kernel for the Complementary Maximal Strip Recovery Problem -- On-line Scheduling with a Monotonous Subsequence Constraint -- A 1.4-Approximation Algorithm For Two-sided Scaffold Filling -- FPT algorithms for FVS parameterized by split and cluster vertex deletion sets and other parameters -- A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order -- Geodectic Contraction Games on Trees -- On Approximation Algorithms for Two-Stage Scheduling Problems -- A New Lower Bound for Positive Zero Forcing -- Phase Transition for Maximum Not-All-Equal Satisfiability.
520 $a This book constitutes the proceedings of the 11th International Workshop on Frontiers in Algorithmics, FAW 2017, held in Chengdu, China, in June 2017. The 24 papers presented in this volume were carefully reviewed and selected from 61 submissions. They deal with all aspects of theoretical computer science and algorithms.
650 0 $a Computer algorithms $x Congresses. $3 576357
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 891007
650 2 4 $a Discrete Mathematics in Computer Science. $3 892513
650 2 4 $a Numeric Computing. $3 892606
650 2 4 $a Data Structures. $3 891009
700 1 $a Xiao, Mingyu. $3 3409713
700 1 $a Rosamond, Frances. $3 3409714
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 10336. $3 3409715
830 0 $a Theoretical computer science and general issues. $3 3382501
856 4 0 $u https://doi.org/10.1007/978-3-319-59605-1
950 $a Computer Science (Springer-11645)