000 | 05013nam a22006855i 4500 | ||
---|---|---|---|
001 | 978-3-030-48966-3 | ||
003 | DE-He213 | ||
005 | 20240730165625.0 | ||
007 | cr nn 008mamaa | ||
008 | 200528s2020 sz | s |||| 0|eng d | ||
020 |
_a9783030489663 _9978-3-030-48966-3 |
||
024 | 7 |
_a10.1007/978-3-030-48966-3 _2doi |
|
050 | 4 | _aQA76.9.M35 | |
050 | 4 | _aQA297.4 | |
072 | 7 |
_aUYAM _2bicssc |
|
072 | 7 |
_aPBD _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYAM _2thema |
|
072 | 7 |
_aPBD _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aCombinatorial Algorithms _h[electronic resource] : _b31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020, Proceedings / _cedited by Leszek Gąsieniec, Ralf Klasing, Tomasz Radzik. |
250 | _a1st ed. 2020. | ||
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2020. |
|
300 |
_aXIX, 424 p. 120 illus., 29 illus. in color. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v12126 |
|
505 | 0 | _aCoordinating swarms of objects at extreme dimensions -- A family of tree-based generators for bubbles in directed graphs -- The micro-world of cographs -- Parameterized Complexity of (A,`)-Path Packing -- On Proper Labellings of Graphs with Minimum Label Sum -- Decremental Optimization of Dominating Sets Under the Reconfiguration Framework -- On the Complexity of Stackelberg Matroid Pricing Problems -- Nonexistence Certificates for Ovals in a Projective Plane of Order Ten -- Edge-Disjoint Branchings in Temporal Graphs -- Optimal In-place Algorithms for Basic Graph Problems -- Further Results on Online Node- and Edge-Deletion Problems with Advice -- Fair packing of independent sets -- Polynomial Time Algorithms for Tracking Path Problems -- The SBP Algorithm for Maximizing Revenue in Online Dial-a-Ride -- Iterated Type Partitions -- Two Robots Patrolling on a Line: Integer Version and Approximability -- Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges -- On the Complexity of Singly Connected Vertex Deletion -- Equitable d-degenerate choosability of graphs -- On the complexity of Broadcast Domination and Multipacking in digraphs -- A Parameterized Perspective on Attacking and Defending Elections -- Skyline Computation with Noisy Comparisons -- Strongly Stable and Maximum Weakly Stable Noncrossing Matchings -- Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions -- The Steiner problem for count matroids -- Bounded Degree Group Steiner problems -- Between proper and strong edge-colorings of subcubic graphs -- Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination -- Algorithms for Constructing Anonymizing Arrays -- Parameterized algorithms for partial vertex covers in bipartite graphs -- Acyclic Matching in Some Subclasses of Graphs. | |
520 | _aThis book constitutes the proceedings of the 31st International Workshop on Combinatorial Algorithms which was planned to take place in Bordeaux, France, during June 8-10, 2020. Due to the COVID-19 pandemic the conference changed to a virtual format. The 30 full papers included in this book were carefully reviewed and selected from 62 submissions. They focus on algorithms design for the myriad of combinatorial problems that underlie computer applications in science, engineering and business. | ||
650 | 0 |
_aComputer science _xMathematics. _93866 |
|
650 | 0 |
_aDiscrete mathematics. _912873 |
|
650 | 0 |
_aArtificial intelligence _xData processing. _921787 |
|
650 | 0 |
_aApplication software. _989873 |
|
650 | 0 |
_aComputer networks . _931572 |
|
650 | 0 |
_aComputer graphics. _94088 |
|
650 | 0 |
_aAlgorithms. _93390 |
|
650 | 1 | 4 |
_aDiscrete Mathematics in Computer Science. _931837 |
650 | 2 | 4 |
_aData Science. _934092 |
650 | 2 | 4 |
_aComputer and Information Systems Applications. _989874 |
650 | 2 | 4 |
_aComputer Communication Networks. _989875 |
650 | 2 | 4 |
_aComputer Graphics. _94088 |
650 | 2 | 4 |
_aAlgorithms. _93390 |
700 | 1 |
_aGąsieniec, Leszek. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _989876 |
|
700 | 1 |
_aKlasing, Ralf. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _989877 |
|
700 | 1 |
_aRadzik, Tomasz. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _989878 |
|
710 | 2 |
_aSpringerLink (Online service) _989879 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783030489656 |
776 | 0 | 8 |
_iPrinted edition: _z9783030489670 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v12126 _989880 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-030-48966-3 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c86434 _d86434 |