|
|
|
|
| LEADER |
03177nam a22003735i 4500 |
| 001 |
000281360 |
| 005 |
20210630161331.0 |
| 007 |
cr nn 008mamaa |
| 008 |
170522s2017 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783319596051
|
| 024 |
7 |
|
|a 10.1007/978-3-319-59605-1
|2 doi
|
| 040 |
|
|
|a Sistema de Bibliotecas del Tecnológico de Costa Rica
|
| 245 |
1 |
0 |
|a Frontiers in Algorithmics :
|b 11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017, Proceedings /
|c edited by Mingyu Xiao, Frances Rosamond.
|
| 250 |
|
|
|a 1st ed. 2017.
|
| 260 |
# |
# |
|a Cham :
|b Springer International Publishing :
|b Imprint: Springer,
|c 2017.
|
| 300 |
|
|
|a X, 281 p. 50 illus. :
|b online resource.
|
| 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 Theoretical Computer Science and General Issues ;
|v 10336
|
| 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. .
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer science—Mathematics.
|
| 650 |
|
0 |
|a Numerical analysis.
|
| 650 |
|
0 |
|a Data structures (Computer science).
|
| 650 |
1 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Numeric Computing.
|
| 650 |
2 |
4 |
|a Data Structures.
|
| 700 |
1 |
|
|a Xiao, Mingyu.
|e editor.
|0 (orcid)0000-0002-1012-2373
|1 https://orcid.org/0000-0002-1012-2373
|
| 700 |
1 |
|
|a Rosamond, Frances.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 900 |
|
|
|a Libro descargado a ALEPH en bloque (proveniente de proveedor)
|