Katalog der Deutschen Nationalbibliothek
Ergebnis der Suche nach: "Tainan"
Treffer 4 von 438
|
|
| Link zu diesem Datensatz | https://d-nb.info/1325802565 |
| Titel | Combinatorial Algorithms : 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7–10, 2023, Proceedings / edited by Sun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee |
| Person(en) |
Hsieh, Sun-Yuan (Herausgeber) Hung, Ling-Ju (Herausgeber) Lee, Chia-Wei (Herausgeber) |
| Organisation(en) | SpringerLink (Online service) (Sonstige) |
| Ausgabe | 1st ed. 2023 |
| Verlag | Cham : Springer Nature Switzerland, Imprint: Springer |
| Zeitliche Einordnung | Erscheinungsdatum: 2023 |
| Umfang/Format | Online-Ressource, XXIII, 406 p. 86 illus., 48 illus. in color. : online resource. |
| Andere Ausgabe(n) |
Printed edition:: ISBN: 978-3-031-34346-9 Printed edition:: ISBN: 978-3-031-34348-3 |
| Inhalt | Multi-Priority Graph Sparsification -- Point Enclosure Problem for Homothetic Polygons -- Hardness of Balanced Mobiles -- Burn and Win -- Min-Max Relative Regret for Scheduling to Minimize Maximum Lateness -- Advice Complexity Bounds for Online Delayed F-Node-, H-Node- and H-Edge-Deletion Problems -- Parameterized algorithms for Eccentricity Shortest Path Problem -- A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs -- Deterministic Performance Guarantees for Bidirectional BFS on Real-World Networks -- A Polyhedral Perspective on Tropical Convolutions -- Online Knapsack with Removal and Recourse -- Minimum Surgical Probing with Convexity Constraints -- A linear algorithm for radio k-coloring powers of paths having small diameter -- Capacity-Preserving Subgraphs of Directed Flow Networks -- Timeline Cover in Temporal Graphs: Exact and Approximation Algorithms -- Finding Small CompleteSubgraphs Efficiently -- Maximal distortion of geodesic diameters in polygonal domains -- On 2-strong connectivity orientations of mixed graphs and related problems -- Make a Graph Singly Connected By Edge Orientations -- Computing the Center of Uncertain Points on Cactus Graphs -- Cosecure Domination: Hardness Results and Algorithms -- Optimal cost-based allocations under two-sided preferences -- Generating cyclic rotation Gray codes for stamp foldings and semi-meanders -- On Computing Large Temporal (Unilateral) Connected Components -- On Integer Linear Programs for Treewidth based on Perfect Elimination Orderings -- Finding Perfect Matching Cuts Faster -- Connected Feedback Vertex Set on AT-Free graphs -- Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries -- Improved Analysis of two Algorithms for Min-Weighted Sum Bin Packing -- Sorting and Ranking of Self-Delimiting Numbers with Applications to Tree Isomorphism -- A Linear Delay Algorithm for Enumeration of 2-Edge/Vertex-connected Induced Subgraphs -- Partial-Adaptive Submodular Maximization -- Budget-Constrained Cost-Covering Job Assignment for a Total Contribution-Maximizing Platform |
| Persistent Identifier |
URN: urn:nbn:de:101:1-2024041104151838685033 DOI: 10.1007/978-3-031-34347-6 |
| URL | https://doi.org/10.1007/978-3-031-34347-6 |
| ISBN/Einband/Preis | 978-3-031-34347-6 |
| Sprache(n) | Englisch (eng) |
| Beziehungen | Lecture Notes in Computer Science ; 13889 |
| DDC-Notation | 004.01 (maschinell ermittelte DDC-Kurznotation) |
| Sachgruppe(n) | 004 Informatik |
| Online-Zugriff | Archivobjekt öffnen |
Treffer 4 von 438
Administration
