Rent Division Among Groups (Englisch)
- Neue Suche nach: Ghodsi, Mohammad
- Neue Suche nach: Latifian, Mohamad
- Neue Suche nach: Mohammadi, Arman
- Neue Suche nach: Moradian, Sadra
- Neue Suche nach: Seddighin, Masoud
- Neue Suche nach: Kim, Donghyun
- Neue Suche nach: Uma, R. N.
- Neue Suche nach: Zelikovsky, Alexander
- Neue Suche nach: Ghodsi, Mohammad
- Neue Suche nach: Latifian, Mohamad
- Neue Suche nach: Mohammadi, Arman
- Neue Suche nach: Moradian, Sadra
- Neue Suche nach: Seddighin, Masoud
In:
Combinatorial Optimization and Applications
: 12th International Conference, COCOA 2018, Atlanta, GA, USA, December 15-17, 2018, Proceedings
;
Kapitel: 39
;
577-591
;
2018
- Aufsatz/Kapitel (Buch) / Elektronische Ressource
-
Titel:Rent Division Among Groups
-
Weitere Titelangaben:Lect.Notes Computer
-
Beteiligte:Kim, Donghyun ( Herausgeber:in ) / Uma, R. N. ( Herausgeber:in ) / Zelikovsky, Alexander ( Herausgeber:in ) / Ghodsi, Mohammad ( Autor:in ) / Latifian, Mohamad ( Autor:in ) / Mohammadi, Arman ( Autor:in ) / Moradian, Sadra ( Autor:in ) / Seddighin, Masoud ( Autor:in )
-
Kongress:International Conference on Combinatorial Optimization and Applications ; 2018 ; Atlanta, GA, USA
-
Erschienen in:Combinatorial Optimization and Applications : 12th International Conference, COCOA 2018, Atlanta, GA, USA, December 15-17, 2018, Proceedings ; Kapitel: 39 ; 577-591Lecture Notes in Computer Science ; 11346 ; 577-591
-
Verlag:
- Neue Suche nach: Springer International Publishing
-
Erscheinungsort:Cham
-
Erscheinungsdatum:16.11.2018
-
Format / Umfang:15 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz/Kapitel (Buch)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Schlagwörter:
-
Datenquelle:
Inhaltsverzeichnis E-Book
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
Fast Approximation of Centrality and Distances in Hyperbolic GraphsChepoi, V. / Dragan, F. F. / Habib, M. / Vaxès, Y. / Alrasheed, H. et al. | 2018
- 2
-
Rectilinear Shortest Paths Among Transient ObstaclesMaheshwari, Anil / Nouri, Arash / Sack, Jörg-Rüdiger et al. | 2018
- 3
-
An Efficient Algorithm for Enumerating Induced Subgraphs with Bounded DegeneracyWasa, Kunihiro / Uno, Takeaki et al. | 2018
- 4
-
Tree t-Spanners of a Graph: Minimizing Maximum Distances EfficientlyCouto, Fernanda / Cunha, Luís Felipe I. et al. | 2018
- 5
-
On the Approximability of Time Disjoint WalksBayen, Alexandre / Goodman, Jesse / Vinitsky, Eugene et al. | 2018
- 6
-
Directed Path-Width of Sequence DigraphsGurski, Frank / Rehs, Carolin / Rethmann, Jochen et al. | 2018
- 7
-
New Results About the Linearization of Scaffolds Sharing Repeated ContigsTabary, Dorine / Davot, Tom / Weller, Mathias / Chateau, Annie / Giroudeau, Rodolphe et al. | 2018
- 8
-
Relaxation and Matrix Randomized Rounding for the Maximum Spectral Subgraph ProblemBazgan, Cristina / Beaujean, Paul / Gourdin, Éric et al. | 2018
- 9
-
Bipartite Communities via Spectral PartitioningYancey, Kelly B. / Yancey, Matthew P. et al. | 2018
- 10
-
Generating Algebraic Expressions for Labeled Grid GraphsKorenblit, Mark et al. | 2018
- 11
-
Editing Graphs to Satisfy Diversity RequirementsChuangpishit, Huda / Lafond, Manuel / Narayanan, Lata et al. | 2018
- 12
-
Computing a Rectilinear Shortest Path amid Splinegons in PlaneChoudhury, Tameem / Inkulu, R. et al. | 2018
- 13
-
Graph Problems with ObligationsCornet, Alexis / Laforest, Christian et al. | 2018
- 14
-
Bipartizing with a MatchingLima, Carlos V. G. C. / Rautenbach, Dieter / Souza, Uéverton S. / Szwarcfiter, Jayme L. et al. | 2018
- 15
-
Removing Undesirable Flows by Edge DeletionPolevoy, Gleb / Trajanovski, Stojan / Grosso, Paola / de Laat, Cees et al. | 2018
- 16
-
Min-Max-Flow Based Algorithm for Evacuation Network Planning in Restricted SpacesHong, Yi / Liu, Jiandong / Luo, Chuanwen / Li, Deying et al. | 2018
- 17
-
Practical and Easy-to-Understand Card-Based Implementation of Yao’s Millionaire ProtocolMiyahara, Daiki / Hayashi, Yu-ichi / Mizuki, Takaaki / Sone, Hideaki et al. | 2018
- 18
-
Defend the Clique-based Attack for Data PrivacyHan, Meng / Miao, Dongjing / Wang, Jinbao / Liu, Liyuan et al. | 2018
- 19
-
Exact Computation of Strongly Connected Reliability by Binary Decision DiagramsSuzuki, Hirofumi / Ishihata, Masakazu / Minato, Shin-ichi et al. | 2018
- 20
-
Upper and Lower Bounds for Different Parameterizations of (n,3)-MAXSATBelova, Tatiana / Bliznets, Ivan et al. | 2018
- 21
-
Related Machine Scheduling with Machine Speeds Satisfying Linear ConstraintsZhang, Siyun / Nip, Kameng / Wang, Zhenbo et al. | 2018
- 22
-
Open-Shop Scheduling for Unit Jobs Under Precedence ConstraintsZhang, An / Chen, Yong / Goebel, Randy / Lin, Guohui et al. | 2018
- 23
-
Makespan Minimization on Unrelated Parallel Machines with Simple Job-Intersection Structure and Bounded Job AssignmentsPage, Daniel R. / Solis-Oba, Roberto / Maack, Marten et al. | 2018
- 24
-
Super-Stability in the Student-Project Allocation Problem with TiesOlaosebikan, Sofiat / Manlove, David et al. | 2018
- 25
-
Primal Dual Algorithm for Partial Set Multi-coverRan, Yingli / Shi, Yishuo / Zhang, Zhao et al. | 2018
- 26
-
Reducing Extension Edges of Concurrent Programs for Reachability AnalysisTian, Cong / Wang, Jiaying / Duan, Zhenhua / Zhao, Liang et al. | 2018
- 27
-
Robustly Assigning Unstable ItemsChristman, Ananya / Chung, Christine / Jaczko, Nicholas / Westvold, Scott / Yuen, David S. et al. | 2018
- 28
-
Hardness Results and Approximation Schemes for Discrete Packing and Domination ProblemsMadireddy, Raghunath Reddy / Mudgal, Apurva / Pandit, Supantha et al. | 2018
- 29
-
Approximability of Covering Cells with Line SegmentsCarmi, Paz / Maheshwari, Anil / Mehrabi, Saeed / Schultz, Luís Fernando / da Silveira, Xavier et al. | 2018
- 30
-
Heuristics for the Score-Constrained Strip-Packing ProblemHawa, Asyl L. / Lewis, Rhyd / Thompson, Jonathan M. et al. | 2018
- 31
-
An Algorithm for Reducing Approximate Nearest Neighbor to Approximate Near Neighbor with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(\log {n})$$\end{document} Query TimeMa, Hengzhao / Li, Jianzhong et al. | 2018
- 32
-
Exact and Approximate Map-Reduce Algorithms for Convex HullGhosh, Anirban / Schwartz, Samuel et al. | 2018
- 33
-
Transmitting Particles in a Polygonal Domain by RepulsionMozafari, Amirhossein / Shermer, Thomas C. et al. | 2018
- 34
-
Does a Robot Path Have Clearance C?Daescu, Ovidiu / Malik, Hemant et al. | 2018
- 35
-
Star Routing: Between Vehicle Routing and Vertex CoverDelle Donne, Diego / Tagliavini, Guido et al. | 2018
- 36
-
Effect of Crowd Composition on the Wisdom of Artificial Crowds MetaheuristicLowrance, Christopher J. / Larkin, Dominic M. / Yim, Sang M. et al. | 2018
- 37
-
Analysis of Consensus Sorting via the Cycle MetricAvramovic, Ivan / Richards, Dana S. et al. | 2018
- 38
-
On the Competitiveness of Memoryless Strategies for the k-Canadian Traveller ProblemBergé, Pierre / Hemery, Julien / Rimmel, Arpad / Tomasik, Joanna et al. | 2018
- 39
-
Rent Division Among GroupsGhodsi, Mohammad / Latifian, Mohamad / Mohammadi, Arman / Moradian, Sadra / Seddighin, Masoud et al. | 2018
- 40
-
Sequence Sentential Decision DiagramsDenzumi, Shuhei et al. | 2018
- 41
-
Online Unit Covering in Euclidean SpaceDumitrescu, Adrian / Ghosh, Anirban / Tóth, Csaba D. et al. | 2018
- 42
-
Isolation Branching: A Branch and Bound Algorithm for the k-Terminal Cut ProblemVelednitsky, Mark / Hochbaum, Dorit S. et al. | 2018
- 43
-
Characterizing Cycle-Complete Dissimilarities in Terms of Associated Indexed 2-HierarchiesAndo, Kazutoshi / Shoji, Kazuya et al. | 2018
- 44
-
Making Multiple RNA Interaction PracticalAhmed, Syed Ali / Farhat, Saman / Mneimneh, Saad et al. | 2018
- 45
-
Max-Min Dispersion on a LineAraki, Tetsuya / Nakano, Shin-ichi et al. | 2018
- 46
-
Integer-Programming Bounds on Pebbling Numbers of Cartesian-Product GraphsKenter, Franklin / Skipper, Daphne et al. | 2018
- 47
-
On the Complexity of Resilience for Aggregation QueriesMiao, Dongjing / Cai, Zhipeng et al. | 2018
- 48
-
Inefficiency of Equilibria in Doodle PollsAnthony, Barbara M. / Chung, Christine et al. | 2018
- 49
-
Network Cost-Sharing Games: Equilibrium Computation and Applications to Election ModelingSwamy, Rahul / Murray, Timothy / Garg, Jugal et al. | 2018
- 50
-
Weak-Barrier Coverage with Adaptive Sensor RotationAranzazu-Suescun, Catalina / Cardei, Mihaela et al. | 2018