Katalog der Deutschen Nationalbibliothek
Ergebnis der Suche nach: "Paris"
Treffer 245 von 210231
|
|
| Link zu diesem Datensatz | https://d-nb.info/1370191111 |
| Art des Inhalts | Konferenzschrift |
| Titel | Frontiers of Algorithmics : 19th International Joint Conference, IJTCS-FAW 2025, Paris, France, June 30 – July 2, 2025, Proceedings / edited by Vincent Chau, Christoph Dürr, Minming Li, Pinyan Lu |
| Person(en) |
Chau, Vincent (Herausgeber) Dürr, Christoph (Herausgeber) Li, Minming (Herausgeber) Lu, Pinyan (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, XIII, 416 p. 32 illus., 17 illus. in color. : online resource. |
| Andere Ausgabe(n) |
Printed edition:: ISBN: 978-981-9683-11-6 Printed edition:: ISBN: 978-981-9683-13-0 |
| Inhalt | Domination in Diameter Two Graphs and the 2 Club Cluster Vertex Deletion Parameter -- $k$-Universality of Regular Languages Revisited -- Comparing the Hardness of Online Minimization and Maximization Problems with Predictions -- Complexity Classes for Online Problems with and without Predictions -- Scheduling with Testing: Competitive Algorithms for Minimizing the Total Weighted Completion Time in the Adversarial Model -- Mixed Graph Covering with Target Constraints -- Multiplication of 0-1 matrices via clustering -- From MAXCUT to MAXNAESAT: Elegant Proofs and Algorithmic Advances -- Exact Algorithms for the Maximum $k$-Balanced Weighted Biclique Problem -- Approximation Algorithms for Individual Preference Facility Location -- The online power cover problem on a line -- The Subinterval Cover Problem -- Oblivious Robots Under Round Robin: Gathering on Rings -- Finding a Set of Long Common Substrings with Repeats from m Input Strings -- A LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties -- Less-excludable Mechanism for DAOs in Public Good Auctions -- TBDS: Transaction-Based Data Sharing -- Pure Nash Equilibria of Weighted Picking Sequence Protocol is WEF1 for Two Agents -- A Comparative Study of Waitlist Mechanisms: Deferral Versus Pay-Per-Offer -- Optimal Repurchasing Contract Design for Efficient Utilization of Computing Resources -- Characterizing Strategyproofness Through Score Functions in Voting Mechanisms -- Minimizing Blocking Agents for Stable Matching with Partial Approval Information -- The Capacity-Constrained Facility Location Problem with Ordinal Preferences: Algorithmic and Mechanism Design Perspectives -- Regularized Minimax-V Learning for Solving Randomly Terminating Two-player Zero-sum Markov Games -- Improved Approximation of Maximin Share Fair Allocation under Generalized Assignment Constraints -- Optimal Hiring Strategy in Auction-Based Crowdsourcing Systems -- Large-Scale Contextual Market Equilibrium Computation through Deep Learning -- Fair Value Distribution in Cooperative Committee Election -- A Payoff-Based Policy Gradient Method in Stochastic Games with Long-Run Average Payoffs -- Mechanism Design for Auctions with Externalities on Budgets |
| Persistent Identifier |
URN: urn:nbn:de:101:1-2506300405109.729338793448 DOI: 10.1007/978-981-96-8312-3 |
| URL | https://doi.org/10.1007/978-981-96-8312-3 |
| ISBN/Einband/Preis | 978-981-96-8312-3 |
| Sprache(n) | Englisch (eng) |
| Beziehungen | Lecture Notes in Computer Science ; 15828 |
| DDC-Notation | 004.01 (maschinell ermittelte DDC-Kurznotation) |
| Sachgruppe(n) | 004 Informatik |
| Online-Zugriff | Archivobjekt öffnen |
Treffer 245 von 210231
Administration
