Del 13595 - Lecture Notes in Computer Science

Computing and Combinatorics

28th International Conference, COCOON 2022, Shenzhen, China, October 22–24, 2022, Proceedings

Häftad, Engelska, 2023

Av Yong Zhang, Dongjing Miao, Rolf Möhring, Rolf Mohring

1 129 kr

Beställningsvara. Skickas inom 7-10 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

Chapter(s) “Chapter Name or No.” is/are available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

Produktinformation

Utgivningsdatum2023-01-02
Mått155 x 235 x 37 mm
Vikt904 g
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor586
FörlagSpringer International Publishing AG
EAN9783031221040

Du kanske också är intresserad av

Del 1997

Operations Research Proceedings 1997

Peter Kischka, Hans-Walter Lorenz, Ulrich Derigs, Wolfgang Domschke, Peter Kleinschmidt, Rolf Möhring

1 709 kr

Baustoffkunde

Wolfram Hiese, Rolf Möhring

599 kr

Del 2461

Algorithms - ESA 2002

Rolf Möhring, Rajeev Raman

1 449 kr

Baustoffkenntnis

Harald Knoblauch, Wilhelm Scholz, Wolfram Hiese, Rolf Möhring

769 kr

Del 1995

Operations Research Proceedings 1995

Peter Kleinschmidt, Achim Bachem, Ulrich Derigs, Dietrich Fischer, Ulrike Leopold-Wildburger, Rolf Möhring

749 kr

Autonomous Driving Network

Wenshuan Dang, River Huang, Yijun Yu, Yong Zhang

2 729 kr

Nyhet

Functional High Entropy Alloys and Compounds

Yong Zhang, Yonggang Yao, Haojie Liu, Yong (Fuyao University of Science and Technology & UST Beijing) Zhang, China) Yao, Yonggang (Huazhong University of Science and Technology, Haojie (Huazhong University of Science and Technology) Liu

1 919 kr

Grasslands on the Third Pole of the World

Shikui Dong, Yong Zhang, Hao Shen, Shuai Li, Yudan Xu

2 229 kr

Smart Health

Chunxiao Xing, Yong Zhang, Ye Liang

709 kr

Sustainable Development of Water Resources and Hydraulic Engineering in China

Wei Dong, Yanqing Lian, Yong Zhang

1 679 kr

Tillhör följande kategorier

A stochastic algorithm for non-monotone DR-submodular maximziation over a convex set.- Flow shop scheduling problems with transportation constraints revisited.- LotterySampling: A Randomized Algorithm for the Heavy Hitters and Top-k Problems in Data Streams.- Approximation Algorithms for the Min-Max Mixed Rural Postmen Cover Problem and Its Variants.- Large k-gons in a 1.5D Terrain.- Nondeterministic Auxiliary Depth-Bounded Storage Automata and Semi-Unbounded Fan-in Cascading Circuits (Extended Abstract).-Analysis of Approximate sorting in I/O model.-Two Generalizations of Proper Coloring: Hardness and Approximability.-Approximation Algorithms for Capacitated Assignment with Budget Constraints and Applications in Transportation Systems.-On the Complexity of Minimum Maximal Acyclic Matchings.-Online non-monotone DR-submodular maximization: 1/4 approximation ratio and sublinear regret.-Fair Division with Minimal Withheld Information in Social Networks.- Facility Location Games with Ordinal Preferences.-Fully Dynamic $k$-Center Clustering with Outliers.-Refutation of Spectral Graph Theory Conjectures with Monte Carlo Search.-Online one-sided smooth function maximization.-Revisiting Maximum Satisfiability and Related Problems in Data Streams.-Turing Machines with Two-level Memory: A Deep Look into the Input/Output Complexity.- A quantum version of Pollard's Rho of which Shor's Algorithm is a particular case.-Single machine scheduling with rejection to minimize the $k$-th power of the makespan.- Escape from the Room.- Algorithms for hard-constraint point processes via discretization.-Space Limited Graph Algorithms on Big Data Counting Cycles on Planar Graphs in Subexponential Time.-Semi-strict chordal digraphs.- Reallocation Problems with Minimum Completion Time.-The bound coverage problem by aligned disks in L1 metric.-Facility Location Games with Group Externalities.- Some New Results on Gallai Theorem and Perfect Matching for k-Uniform Hypergraphs.- Refined Computational Complexities of Hospitals/Residents Problem with Regional Caps.- Customizable Hub Labeling: Properties and Algorithms Linear-Time Algorithm for Paired-Domination on Distance-Hereditary Graphs.-Bounding the Number of Eulerian Tours in Undirected Graphs.- A Probabilistic Model Revealing Shortcomings in Lua's Hybrid Tables.- A 4-Space Bounded.- Approximation Algorithm \\for Online Bin Packing Problem.-Generalized Sweeping Line Spanners.- Rooting Gene Trees via Phylogenetic Networks.- An evolving network model from clique extension.- Online semi-matching problem with two heterogeneous sensors in a metric space.- Two-Stage BP Maximization under $p$-matroid Constraint.- The Hamiltonian Path Graph is Connected for Simple $s,t$ Paths in Rectangular Grid Graphs.- An $O(n^3)$-Time Algorithm for the Min-Gap.- Unit-Length Job Scheduling Problem.- Approximation Schemes for k-Facility Location.- Improved Deterministic Algorithms for Non-monotone Submodular Maximization.- Distributed Dominating Sets in Interval Graphs.- Optimal Window Queries on Line Segments using the Trapezoidal Search DAG.- On Rotation Distance, Transpositions and Rank Bounded Trees.- Hitting Geometric Objects Online via Points in $\mathbb{Z}^d$.- Capacitated Facility Location with Outliers/Penalties Improved Separated Red Blue Center Clustering.- Proper colorability of segment intersection graphs.