Katalog der Deutschen Nationalbibliothek

Neuigkeiten

Leichte Bedienung, intuitive Suche: Die Betaversion unseres neuen Katalogs ist online! → Zur Betaversion des neuen DNB-Katalogs

 
Neuigkeiten 2. bis 5. Oktober 2025: Der Kartenlesesaal in Leipzig ist geschlossen. // 2 to 5 October 2025: The map reading room in Leipzig is closed.
 
 

Ergebnis der Suche nach: "Image"



Treffer 314 von 115198 < < > <



Online Ressourcen
Link zu diesem Datensatz https://d-nb.info/137337179X
Art des Inhalts Konferenzschrift
Titel Computing and Combinatorics : 30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part I / edited by Yong Chen, Xiaofeng Gao, Xiaoming Sun, An Zhang
Person(en) Chen, Yong (Herausgeber)
Gao, Xiaofeng (Herausgeber)
Sun, Xiaoming (Herausgeber)
Zhang, An (Herausgeber)
Organisation(en) SpringerLink (Online service) (Sonstige)
Ausgabe 1st ed. 2025
Verlag Singapore : Springer Nature Singapore, Imprint: Springer
Zeitliche Einordnung Erscheinungsdatum: 2025
Umfang/Format Online-Ressource, XXII, 573 p. 106 illus., 52 illus. in color. : online resource.
Andere Ausgabe(n) Printed edition:: ISBN: 978-981-9610-89-1
Printed edition:: ISBN: 978-981-9610-91-4
Inhalt -- Can the 1.375 approximation ratio of unsigned genomes distances be improved?. -- An optimal absolute approximation algorithm for computing $k$ restricted shortest paths. -- On Extensions of Min-k-Union. -- Sublinear Algorithms for Scheduling with Chain Precedence Constraints. -- Bicriteria approximation algorithms for the unit disk coverage problem. -- Private Neural Network Training with Packed Secret Sharing. -- k-Balanced Biclique Partition on Signed Bipartite Graphs. -- Bi-criteria Sublinear Time Algorithms for Clustering with Outliers in High Dimensions. -- On Sorting Signed Permutations by Flanked DCJs. -- Approximating the Maximum Weight Cycle/Path Partition in Graphs with Weights One and Two. -- Relations between monotone complexity measures based on decision tree complexity. -- Minimum sum vertex cover: kernelization and parameterized algorithms. -- Facility location game for maximizing the social satisfaction on a line. -- Design and Characterization of Strategy-Proof Mechanisms for Two-Facility Game on a Line. -- MPMD on Two Sources with Lookahead. -- Improved Approximation Algorithms for Multiprocessor Indivisible Coflow Scheduling. -- Facility Assignment with Fair Cost Sharing: Equilibrium and Mechanism Design. -- 1.6-approximation algorithm for generalized traveling salesman path probem. -- Assortment Planning with Sponsored Products. -- NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam. -- Near-Optimal Algorithm for Supporting Small and Medium-sized Enterprises in Ad Systems. -- The Complexity of Distance-$r$ Dominating Set Reconfiguration. -- A characterization of uniquely representable two-directional orthogonal ray graphs. -- The complexity of strong confl?ict-free vertex-connection k-colorability. -- Parameterized Algorithms for Planar 2-layer Drawing by Vertex Splitting on a Given Subset. -- Bipartite domination in outerplanar graphs. -- Robust Matroid Bandit Optimization against Adversarial Contamination. -- Nash equilibrium and price of anarchy for scheduling games based on a mixed coordination mechanism. -- Trade-off Between Maximum Flow Time and Energy Intake in EV Charging. -- Maximin Share Allocation under Knapsack Constraint. -- On the Minimum Edge Bisection of Graph. -- Random Schreier graphs as expanders. -- Direct Sum Theorems From Fortification. -- On Sorting by Unsigned Symmetric Reversals. -- Some Results on Critical ($P_5,H$)-free Graphs. -- Single machine lot scheduling to minimize maximum weighted completion time. -- A Quadratic Vertex Kernel for Diamond-free Edge Deletion. -- Graph convexity partizan games. -- Almost optimum $\ell$-covering of $\mathbbZ}_n$. -- The Communication Complexity of Distributed Maximization. -- Approximately Covering Vertices by Order-5 or Longer Paths. -- An FPT Constant-Factor Approximation Algorithm for Correlation Clustering. -- A Little Aggression Goes a Long Way. -- Monotone Properties of Uncertain Graphs
Persistent Identifier URN: urn:nbn:de:101:1-2508080408498.546906352914
DOI: 10.1007/978-981-96-1090-7
URL https://doi.org/10.1007/978-981-96-1090-7
ISBN/Einband/Preis 978-981-96-1090-7
Sprache(n) Englisch (eng)
Beziehungen Lecture Notes in Computer Science ; 15161
DDC-Notation 004.01 (maschinell ermittelte DDC-Kurznotation)
Sachgruppe(n) 004 Informatik

Online-Zugriff Archivobjekt öffnen




Treffer 314 von 115198
< < > <


E-Mail-IconAdministration