×

Found 517 Documents (Results 1–100)

Maximum-weight matching in sliding windows and beyond. (English) Zbl 07788646

Ahn, Hee-Kap (ed.) et al., 32nd international symposium on algorithms and computation, ISAAC 2021, Fukuoka, Japan, December 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 212, Article 73, 16 p. (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

An approximation algorithm for maximum stable matching with ties and constraints. (English) Zbl 07788644

Ahn, Hee-Kap (ed.) et al., 32nd international symposium on algorithms and computation, ISAAC 2021, Fukuoka, Japan, December 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 212, Article 71, 16 p. (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Augmenting graphs to minimize the radius. (English) Zbl 07788618

Ahn, Hee-Kap (ed.) et al., 32nd international symposium on algorithms and computation, ISAAC 2021, Fukuoka, Japan, December 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 212, Article 45, 20 p. (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

A tight local algorithm for the minimum dominating set problem in outerplanar graphs. (English) Zbl 07774264

Gilbert, Seth (ed.), 35th international symposium on distributed computing, DISC 2021, Freiburg, Germany (virtual conference) October 4–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 209, Article 13, 18 p. (2021).
MSC:  68M14 68W15
PDFBibTeX XMLCite
Full Text: DOI arXiv

Sampling multiple edges efficiently. (English) Zbl 07768396

Wootters, Mary (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 24th international conference, APPROX 2021, and 25th international conference, RANDOM 2021, University of Washington, Seattle, Washington, US (virtual conference), August 16–18, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 207, Article 51, 15 p. (2021).
MSC:  68W20 68W25 90C27
PDFBibTeX XMLCite
Full Text: DOI arXiv

A new notion of commutativity for the algorithmic Lovász local lemma. (English) Zbl 07768376

Wootters, Mary (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 24th international conference, APPROX 2021, and 25th international conference, RANDOM 2021, University of Washington, Seattle, Washington, US (virtual conference), August 16–18, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 207, Article 31, 25 p. (2021).
MSC:  68W20 68W25 90C27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Fine-grained completeness for optimization in P. (English) Zbl 07768354

Wootters, Mary (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 24th international conference, APPROX 2021, and 25th international conference, RANDOM 2021, University of Washington, Seattle, Washington, US (virtual conference), August 16–18, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 207, Article 9, 22 p. (2021).
MSC:  68W20 68W25 90C27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Approximating Nash social welfare under Rado valuations. (English) Zbl 07765258

Khuller, Samir (ed.) et al., Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC ’21, virtual, Italy, June 21–25, 2021. New York, NY: Association for Computing Machinery (ACM). 1412-1425 (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

A \((2+\varepsilon)\)-approximation algorithm for preemptive weighted flow time on a single machine. (English) Zbl 07765230

Khuller, Samir (ed.) et al., Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC ’21, virtual, Italy, June 21–25, 2021. New York, NY: Association for Computing Machinery (ACM). 1042-1055 (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Reducing isotropy and volume to KLS: an \(O*(n^3\psi^2)\) volume algorithm. (English) Zbl 07765224

Khuller, Samir (ed.) et al., Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC ’21, virtual, Italy, June 21–25, 2021. New York, NY: Association for Computing Machinery (ACM). 961-974 (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Restricted adaptivity in stochastic scheduling. (English) Zbl 1521.90077

Mutzel, Petra (ed.) et al., 29th annual European symposium on algorithms. ESA 2021, Lisbon, Portugal (virtual conference), September 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 204, Article 79, 14 p. (2021).
MSC:  90B36
PDFBibTeX XMLCite
Full Text: DOI arXiv

Closing the gap for single resource constraint scheduling. (English) Zbl 07740908

Mutzel, Petra (ed.) et al., 29th annual European symposium on algorithms. ESA 2021, Lisbon, Portugal (virtual conference), September 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 204, Article 53, 15 p. (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Quantum sub-Gaussian mean estimator. (English) Zbl 07740905

Mutzel, Petra (ed.) et al., 29th annual European symposium on algorithms. ESA 2021, Lisbon, Portugal (virtual conference), September 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 204, Article 50, 17 p. (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry. (English) Zbl 07740875

Mutzel, Petra (ed.) et al., 29th annual European symposium on algorithms. ESA 2021, Lisbon, Portugal (virtual conference), September 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 204, Article 20, 15 p. (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Distant representatives for rectangles in the plane. (English) Zbl 07740872

Mutzel, Petra (ed.) et al., 29th annual European symposium on algorithms. ESA 2021, Lisbon, Portugal (virtual conference), September 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 204, Article 17, 18 p. (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

An approximation algorithm for the matrix tree multiplication problem. (English) Zbl 07724179

Bonchi, Filippo (ed.) et al., 46th international symposium on mathematical foundations of computer science, MFCS 2021, August 23–27, 2021, Tallinn, Estonia. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 202, Article 6, 14 p. (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Minimum scan cover and variants - theory and experiments. (English) Zbl 07700586

Coudert, David (ed.) et al., 19th international symposium on experimental algorithms, SEA 2021, Nice, France, June 7–9, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 190, Article 4, 16 p. (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Online and approximate network construction from bounded connectivity constraints. (English) Zbl 07667139

Calamoneri, Tiziana (ed.) et al., Algorithms and complexity. 12th international conference, CIAC 2021, virtual event, May 10–12, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12701, 314-325 (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Experimental sensitivity analysis of grid-based parameter adaptation method. (English) Zbl 1505.90154

Yalaoui, Farouk (ed.) et al., Heuristics for optimization and learning. Selected papers based on the presentations of the 7th international conference on metaheuristics and nature inspired computing, META’18, Marrakech, Morocco, October 27–31, 2018. Cham: Springer. Stud. Comput. Intell. 906, 335-346 (2021).
MSC:  90C59
PDFBibTeX XMLCite
Full Text: DOI

Memetic algorithm and evolutionary operators for multi-objective matrix tri-factorization problem. (English) Zbl 1505.90150

Yalaoui, Farouk (ed.) et al., Heuristics for optimization and learning. Selected papers based on the presentations of the 7th international conference on metaheuristics and nature inspired computing, META’18, Marrakech, Morocco, October 27–31, 2018. Cham: Springer. Stud. Comput. Intell. 906, 285-298 (2021).
MSC:  90C59
PDFBibTeX XMLCite
Full Text: DOI

Stock market speculation system development based on technico temporal indicators and data mining tools. (English) Zbl 1505.91359

Yalaoui, Farouk (ed.) et al., Heuristics for optimization and learning. Selected papers based on the presentations of the 7th international conference on metaheuristics and nature inspired computing, META’18, Marrakech, Morocco, October 27–31, 2018. Cham: Springer. Stud. Comput. Intell. 906, 239-251 (2021).
MSC:  91G15 90C59
PDFBibTeX XMLCite
Full Text: DOI

Heuristic solutions for the \((\alpha, \beta)\)-\(k\) feature set problem. (English) Zbl 1505.90109

Yalaoui, Farouk (ed.) et al., Heuristics for optimization and learning. Selected papers based on the presentations of the 7th international conference on metaheuristics and nature inspired computing, META’18, Marrakech, Morocco, October 27–31, 2018. Cham: Springer. Stud. Comput. Intell. 906, 139-150 (2021).
MSC:  90C27 90C59
PDFBibTeX XMLCite
Full Text: DOI

An asynchronous parallel evolutionary algorithm for solving large instances of the multi-objective QAP. (English) Zbl 1505.90120

Yalaoui, Farouk (ed.) et al., Heuristics for optimization and learning. Selected papers based on the presentations of the 7th international conference on metaheuristics and nature inspired computing, META’18, Marrakech, Morocco, October 27–31, 2018. Cham: Springer. Stud. Comput. Intell. 906, 69-85 (2021).
MSC:  90C29 90B80 90C59
PDFBibTeX XMLCite
Full Text: DOI

Solving 0-1 bi-objective multi-dimensional knapsack problems using binary genetic algorithm. (English) Zbl 1505.90103

Yalaoui, Farouk (ed.) et al., Heuristics for optimization and learning. Selected papers based on the presentations of the 7th international conference on metaheuristics and nature inspired computing, META’18, Marrakech, Morocco, October 27–31, 2018. Cham: Springer. Stud. Comput. Intell. 906, 51-67 (2021).
MSC:  90C27 90C29 90C59
PDFBibTeX XMLCite
Full Text: DOI

On VNS-GRASP and iterated greedy metaheuristics for solving hybrid flow shop scheduling problem with uniform parallel machines and sequence independent setup time. (English) Zbl 1505.90051

Yalaoui, Farouk (ed.) et al., Heuristics for optimization and learning. Selected papers based on the presentations of the 7th international conference on metaheuristics and nature inspired computing, META’18, Marrakech, Morocco, October 27–31, 2018. Cham: Springer. Stud. Comput. Intell. 906, 17-32 (2021).
MSC:  90B35 90C59
PDFBibTeX XMLCite
Full Text: DOI

A genetic algorithm for solving the inventory routing problem with time windows. (English) Zbl 1500.90005

Zapata-Cortes, Julian Andres (ed.) et al., New perspectives on enterprise decision-making applying artificial intelligence techniques. Cham: Springer. Stud. Comput. Intell. 966, 463-481 (2021).
MSC:  90B06 90B05 90C59
PDFBibTeX XMLCite
Full Text: DOI

Eco-driving adaptive cruise control via model predictive control enhanced with improved grey wolf optimization algorithm. (English) Zbl 1497.90064

Masone, Adriano (ed.) et al., Optimization and data science: trends and applications. 5th AIROYoung workshop and AIRO PhD school 2021 joint event, February 8–12, 2021. Cham: Springer. AIRO Springer Ser. 6, 139-153 (2021).
MSC:  90B20 90C59
PDFBibTeX XMLCite
Full Text: DOI

Approximation and mean field control of systems of large populations. (English) Zbl 1496.49020

Hernández-Hernández, Daniel (ed.) et al., Advances in probability and mathematical statistics. CLAPEM 2019. Contributions of the 15th Latin American congress of probability and mathematical statistics, Mérida, Mexico, December 2–6, 2019. Cham: Birkhäuser. Prog. Probab. 79, 103-122 (2021).
PDFBibTeX XMLCite
Full Text: DOI

A fast FPTAS for two dimensional barrier coverage using sink-based mobile sensors with MinSum movement. (English) Zbl 1498.68041

Wu, Weili (ed.) et al., Algorithmic aspects in information and management. 15th international conference, AAIM 2021, virtual event, December 20–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13153, 265-276 (2021).
MSC:  68M18 68U05 68W25
PDFBibTeX XMLCite
Full Text: DOI

Multi-attribute based influence maximization in social networks. (English) Zbl 1498.91324

Wu, Weili (ed.) et al., Algorithmic aspects in information and management. 15th international conference, AAIM 2021, virtual event, December 20–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13153, 240-251 (2021).
MSC:  91D30 68W25
PDFBibTeX XMLCite
Full Text: DOI

Measured continuous greedy with differential privacy. (English) Zbl 1498.90203

Wu, Weili (ed.) et al., Algorithmic aspects in information and management. 15th international conference, AAIM 2021, virtual event, December 20–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13153, 212-226 (2021).
PDFBibTeX XMLCite
Full Text: DOI

Fixed observation time-step: adaptive influence maximization. (English) Zbl 1498.91333

Wu, Weili (ed.) et al., Algorithmic aspects in information and management. 15th international conference, AAIM 2021, virtual event, December 20–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13153, 200-211 (2021).
MSC:  91D30 68W25
PDFBibTeX XMLCite
Full Text: DOI

Bi-criteria adaptive algorithms for minimizing supermodular functions with cardinality constraint. (English) Zbl 1503.90125

Wu, Weili (ed.) et al., Algorithmic aspects in information and management. 15th international conference, AAIM 2021, virtual event, December 20–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13153, 179-189 (2021).
MSC:  90C27 90C59
PDFBibTeX XMLCite
Full Text: DOI

An approximation algorithm for solving the heterogeneous Chinese postman problem. (English) Zbl 1503.90115

Wu, Weili (ed.) et al., Algorithmic aspects in information and management. 15th international conference, AAIM 2021, virtual event, December 20–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13153, 38-46 (2021).
MSC:  90C27 90C59
PDFBibTeX XMLCite
Full Text: DOI

Approximation algorithms for the maximum bounded connected bipartition problem. (English) Zbl 1498.68210

Wu, Weili (ed.) et al., Algorithmic aspects in information and management. 15th international conference, AAIM 2021, virtual event, December 20–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13153, 27-37 (2021).
MSC:  68R10 05C70 68W25
PDFBibTeX XMLCite
Full Text: DOI

Approximation algorithm for the capacitated correlation clustering problem with penalties. (English) Zbl 1503.90111

Wu, Weili (ed.) et al., Algorithmic aspects in information and management. 15th international conference, AAIM 2021, virtual event, December 20–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13153, 15-26 (2021).
MSC:  90C27 90C35 90C59
PDFBibTeX XMLCite
Full Text: DOI

Constant-approximation for prize-collecting min-sensor sweep coverage with base stations. (English) Zbl 1498.68040

Wu, Weili (ed.) et al., Algorithmic aspects in information and management. 15th international conference, AAIM 2021, virtual event, December 20–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13153, 3-14 (2021).
PDFBibTeX XMLCite
Full Text: DOI

Approximation algorithm for min-max correlation clustering problem with outliers. (English) Zbl 07550560

Du, Ding-Zhu (ed.) et al., Combinatorial optimization and applications. 15th international conference, COCOA 2021, Tianjin, China, December 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13135, 668-675 (2021).
MSC:  68T20 90C27
PDFBibTeX XMLCite
Full Text: DOI

A LP-based approximation algorithm for generalized traveling salesperson path problem. (English) Zbl 07550558

Du, Ding-Zhu (ed.) et al., Combinatorial optimization and applications. 15th international conference, COCOA 2021, Tianjin, China, December 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13135, 641-652 (2021).
MSC:  68T20 90C27
PDFBibTeX XMLCite
Full Text: DOI

An improved approximation algorithm for squared metric \(k\)-facility location. (English) Zbl 07550550

Du, Ding-Zhu (ed.) et al., Combinatorial optimization and applications. 15th international conference, COCOA 2021, Tianjin, China, December 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13135, 538-552 (2021).
MSC:  68T20 90C27
PDFBibTeX XMLCite
Full Text: DOI

Parallel algorithm for minimum partial dominating set in unit disk graph. (English) Zbl 07550549

Du, Ding-Zhu (ed.) et al., Combinatorial optimization and applications. 15th international conference, COCOA 2021, Tianjin, China, December 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13135, 527-537 (2021).
MSC:  68T20 90C27
PDFBibTeX XMLCite
Full Text: DOI

Open shop scheduling problem with a non-resumable flexible maintenance period. (English) Zbl 07550548

Du, Ding-Zhu (ed.) et al., Combinatorial optimization and applications. 15th international conference, COCOA 2021, Tianjin, China, December 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13135, 512-526 (2021).
MSC:  68T20 90C27
PDFBibTeX XMLCite
Full Text: DOI

Approximation algorithms for some min-max and minimum stacker crane cover problems. (English) Zbl 07550540

Du, Ding-Zhu (ed.) et al., Combinatorial optimization and applications. 15th international conference, COCOA 2021, Tianjin, China, December 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13135, 400-415 (2021).
MSC:  68T20 90C27
PDFBibTeX XMLCite
Full Text: DOI

New approximation algorithms for the rooted budgeted cycle cover problem. (English) Zbl 07550522

Du, Ding-Zhu (ed.) et al., Combinatorial optimization and applications. 15th international conference, COCOA 2021, Tianjin, China, December 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13135, 167-179 (2021).
MSC:  68T20 90C27
PDFBibTeX XMLCite
Full Text: DOI

Approximation algorithms for two parallel dedicated machine scheduling with conflict constraints. (English) Zbl 07550518

Du, Ding-Zhu (ed.) et al., Combinatorial optimization and applications. 15th international conference, COCOA 2021, Tianjin, China, December 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13135, 111-124 (2021).
MSC:  68T20 90C27
PDFBibTeX XMLCite
Full Text: DOI

An improved approximation algorithm for capacitated correlation clustering problem. (English) Zbl 07550512

Du, Ding-Zhu (ed.) et al., Combinatorial optimization and applications. 15th international conference, COCOA 2021, Tianjin, China, December 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13135, 35-45 (2021).
MSC:  68T20 90C27
PDFBibTeX XMLCite
Full Text: DOI

Two-stage submodular maximization under curvature. (English) Zbl 07550511

Du, Ding-Zhu (ed.) et al., Combinatorial optimization and applications. 15th international conference, COCOA 2021, Tianjin, China, December 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13135, 25-34 (2021).
MSC:  68T20 90C27
PDFBibTeX XMLCite
Full Text: DOI

A refined model of viscoelastic-plastic deformation of flexible plates with spatial reinforcement structures. (English. Russian original) Zbl 1494.74051

J. Appl. Mech. Tech. Phys. 62, No. 7, 1045-1062 (2021); translation from Vychisl. Mekh. Splosh. Sred 13, No. 1, 5-22 (2020).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Serial

all top 3

Main Field

all top 3

Software