Suchergebnisse - "Practical approximation algorithms"

Efficient and Practical Approximation Algorithms for Advertising in Content Feeds

Autoren: Guangyi Zhang Ilie Sarpe Aristides Gionis

Quelle: Proceedings of the ACM on Web Conference 2025. :3193-3203

Schlagwörter: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Zugangs-URL: http://arxiv.org/abs/2502.02115

Efficient and Practical Approximation Algorithms for Advertising in Content Feeds

Autoren: Zhang, Guangyi Sarpe, Ilie Gionis, Aristides

Index Begriffe: Ad Allocation, Approximation Algorithms, Externalities, Matching, Newsfeed Advertising, Computer Sciences, Datavetenskap (datalogi), Conference paper, info:eu-repo/semantics/conferenceObject, text

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-363994
WWW2025-ProceedingsoftheACMWebConference,p.3193-3203
WWW 2025 - Proceedings of the ACM Web Conference, p. 3193-3203

Practical approximation algorithms for $${\ell}_1$$-regularized sparse rank-1 approximation to higher-order tensors

Autoren: Xianpeng Mao Yuning Yang

Quelle: Optimization Letters. 18:767-781

Schlagwörter: Optimization and Control (math.OC), FOS: Mathematics, Mathematics - Optimization and Control

Zugangs-URL: http://arxiv.org/abs/2207.07383

Practical Approximation Algorithms for Stabbing Special Families of Line Segments with Equal Disks

Autoren: Konstantin Kobylkin Irina Dryakhlova

Quelle: Lecture Notes in Computer Science ISBN: 9783030535513

Zugangs-URL: https://dblp.uni-trier.de/db/conf/lion/lion2020.html#KobylkinD20
https://science.urfu.ru/ru/publications/practical-approximation-algorithms-for-stabbing-special-families-
https://link.springer.com/chapter/10.1007/978-3-030-53552-0_7

Practical Approximation Algorithms for Zero- and Bounded-Skew Trees: Practical approximation algorithms for zero- and bounded-skew trees

Autoren: Alexander Zelikovsky Ion I. Mandoiu

Quelle: SIAM Journal on Discrete Mathematics. 15:97-111

Schlagwörter: VLSI physical design, Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.), Graph algorithms (graph-theoretic aspects), 0202 electrical engineering, electronic engineering, information engineering, Steiner trees, clock routing, Analysis of algorithms, 02 engineering and technology, 0101 mathematics, approximation algorithms, 01 natural sciences, Approximation algorithms, Trees

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1732392
https://doi.org/10.1137/s0895480100378367
https://epubs.siam.org/doi/abs/10.1137/S0895480100378367
https://dblp.uni-trier.de/db/journals/siamdm/siamdm15.html#ZelikovskyM01
https://doi.org/10.1137/S0895480100378367
https://dl.acm.org/doi/10.5555/365411.365490
https://dblp.uni-trier.de/db/conf/soda/soda2001.html#ZelikovskyM01

Practical approximation algorithms for clustering and covering

Autoren: McClintock, Jessica

Index Begriffe: PhD thesis

URL: http://hdl.handle.net/11343/214762

Practical Approximation Algorithms for Separable Packing Linear Programs

Autoren: Sudhakar Muddu Andrew B. Kahng Alexander Zelikovsky et al.

Quelle: Lecture Notes in Computer Science ISBN: 9783540424239

Zugangs-URL: http://vlsicad.ucsd.edu/Publications/Conferences/127/c127.pdf
https://link.springer.com/chapter/10.1007%2F3-540-44634-6_30
http://www.cs.kent.edu/~dragan/WADS01.pdf
https://rd.springer.com/chapter/10.1007/3-540-44634-6_30
https://core.ac.uk/display/24386503
http://vlsicad.ucsd.edu/Publications/Conferences/126/c126.pdf
https://dblp.uni-trier.de/db/conf/wads/wads2001.html#DraganKMMZ01

Practical approximation algorithms for ℓ1-regularized sparse rank-1 approximation to higher-order tensors.

Autoren: Mao, Xianpeng Yang, Yuning

Quelle: Optimization Letters; Apr2024, Vol. 18 Issue 3, p767-781, 15p

Practical Approximation Algorithms for Zero- and Bounded-Skew Trees

Autoren: Alexander Zelikovsky Ion Mandoiu The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Alexander Zelikovsky Ion Mandoiu The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.cc.gatech.edu/people/home/mandoiu/pub/zst.ps.

Dateibeschreibung: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.4976; http://www.cc.gatech.edu/people/home/mandoiu/pub/zst.ps

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.4976
http://www.cc.gatech.edu/people/home/mandoiu/pub/zst.ps

Practical Approximation Algorithms for Separable Packing Linear Programs

Autoren: Feodor F. Dragan Andrew B. Kahng Ion I. Mandoiu et al.

Weitere Verfasser: Feodor F. Dragan Andrew B. Kahng Ion I. Mandoiu et al.

Quelle: http://www.cs.kent.edu/~dragan/WADS01.pdf.

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.6378; http://www.cs.kent.edu/~dragan/WADS01.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.6378
http://www.cs.kent.edu/~dragan/WADS01.pdf

Practical Approximation Algorithms for Separable Packing Linear Programs

Autoren: Feodor F. Dragan Andrew B. Kahng Ion I. Mandoiu et al.

Weitere Verfasser: Feodor F. Dragan Andrew B. Kahng Ion I. Mandoiu et al.

Quelle: http://nexus6.cs.ucla.edu/~abk/papers/conference/c127.ps.

Dateibeschreibung: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.531; http://nexus6.cs.ucla.edu/~abk/papers/conference/c127.ps

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.531
http://nexus6.cs.ucla.edu/~abk/papers/conference/c127.ps

Practical approximation algorithms for separable packing linear programs

Autoren: Feodor F. Dragan Andrew B. Kahng Ioni. Măndoiu et al.

Weitere Verfasser: Feodor F. Dragan Andrew B. Kahng Ioni. Măndoiu et al.

Quelle: http://vlsicad.ucsd.edu/Publications/Conferences/127/c127.pdf.

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.189.4098; http://vlsicad.ucsd.edu/Publications/Conferences/127/c127.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.189.4098
http://vlsicad.ucsd.edu/Publications/Conferences/127/c127.pdf

Practical approximation algorithms for zero- and bounded-skew trees

Autoren: Alexander Z. Zelikovsky Ion I. M Andoiu The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Alexander Z. Zelikovsky Ion I. M Andoiu The Pennsylvania State University CiteSeerX Archives

Quelle: http://suez.cs.gsu.edu/~cscazz/postscript/zst.pdf.

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.9361; http://suez.cs.gsu.edu/~cscazz/postscript/zst.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.9361
http://suez.cs.gsu.edu/~cscazz/postscript/zst.pdf

Practical Approximation Algorithms forZero- and Bounded-Skew Trees

Weitere Verfasser: The Pennsylvania State University CiteSeerX Archives

Quelle: http://suez.cs.gsu.edu/~cscazz/postscript/zst.ps.

Dateibeschreibung: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.9114; http://suez.cs.gsu.edu/~cscazz/postscript/zst.ps

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.9114
http://suez.cs.gsu.edu/~cscazz/postscript/zst.ps

Practical Approximation Algorithms for Zero- and Bounded-Skew Trees \Lambda

Weitere Verfasser: The Pennsylvania State University CiteSeerX Archives

Quelle: http://suez.cs.gsu.edu/~cscazz/postscript/sidma.ps.

Dateibeschreibung: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.1769; http://suez.cs.gsu.edu/~cscazz/postscript/sidma.ps

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.1769
http://suez.cs.gsu.edu/~cscazz/postscript/sidma.ps

PRACTICAL APPROXIMATION ALGORITHMS FOR ZERO-AND BOUNDED-SKEW TREES.

Autoren: Zelikovsky, Alexander Z. Mandoiu, Ion I.

Quelle: SIAM Journal on Discrete Mathematics; 2001, Vol. 15 Issue 1, p97-111, 15p

Schlagwörter: TREE graphs, DIVISION rings, APPROXIMATION theory, FUNCTIONAL analysis, ALGORITHMS, ALGEBRAIC field theory

Ranking with submodular functions on the fly

Autoren: Zhang, Guangyi Tatti, Nikolaj Gionis, Aristides

Index Begriffe: Computer Sciences, Datavetenskap (datalogi), Conference paper, info:eu-repo/semantics/conferenceObject, text

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-350166
2023 SIAM International Conference on Data Mining, SDM 2023, p. 604-612

An Integrated Approach to Real-Time 3D Sensor Data Visualization for Digital Twin Applications.

Autoren: Kim, Hyungki Suh, Hyowon

Quelle: Electronics (2079-9292); Aug2025, Vol. 14 Issue 15, p2938, 20p

Schlagwörter: DIGITAL twin, REAL-time computing, ACQUISITION of data, THREE-dimensional imaging, ELECTRONIC data processing, PARALLEL processing

Digraph k-Coloring Games: From Theory to Practice

Autoren: D'Ascenzo, Andrea D'Emidio, Mattia Flammini, Michele et al.

Index Begriffe: Algorithmic Game Theory, Coloring Games, Experimental Algorithmics, Exact vs Approximate Nash Equilibria, Decentralized Dynamics, Data processing Computer science, InProceedings, publishedVersion

$\alpha$-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms

Autoren: Manne, Fredrik Philip, Geevarghese Saurabh, Saket et al.

Index Begriffe: Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/2106.14169